94 search results - page 17 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
ICDCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
ICDCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to r...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
SP
2002
IEEE
13 years 7 months ago
2002
IEEE
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...