Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of simple algorithms for dynamic load balancing
Mathematics of Operations Research
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
The analysis of a list-coloring algorithm on a random graph
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Randomized Allocation Processes
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Load balancing and density dependent jump Markov processes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Balls and Bins with Deletions
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Cuckoo hashing: further analysis
Information Processing Letters
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences - STOC 2002
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Randomized load balancing with general service time distributions
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Markov chains with discontinuous drifts have differential inclusion limits
Performance Evaluation
Area-efficient near-associative memories on FPGAs
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
| Hi-index | 0.00 |
Using differential equations, we examine the GREEDY algorithm studied by Azar, Broder, Karlin and Upfal for distributed load balancing [1]. This approach yields accurate estimates of the actual load distribution, provides insight into the exponential improvement GREEDY offers over simple random selection, and allows one to prove tight concentration theorems about the loads in a straightforward manner.