1929 search results - page 186 / 386 » Load Balancing with Memory |
92
Voted
CGO
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
108
Voted
MIDDLEWARE
2007
Springer
15 years 6 months ago
2007
Springer
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
155
click to vote
ANCS
2009
ACM
14 years 10 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
112
click to vote
FCCM
2008
IEEE
15 years 7 months ago
2008
IEEE
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...
101
click to vote
JDA
2008
15 years 21 days ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...