94 search results - page 9 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
GCC
2005
Springer
14 years 1 months ago
2005
Springer
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
MICRO
1999
IEEE
14 years 4 days ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
OOPSLA
2007
Springer
14 years 2 months ago
2007
Springer
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...