94 search results - page 3 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
SPAA
2005
ACM
14 years 17 days ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...