| Abstract |
|
Consistent hashing can be used to assign objects to nodes in a distributed system. It has been used by several distributed systems including Chord, Pastry, and Tornado because of its efficient handling of node failure and repair. In this paper we analyze how well consistent hashing does at evenly distributing objects among the nodes in the system. We also extend current consistent hashing algorithms to allow for dynamic load balancing while retaining the good properties of consistent hashing. Finally we analyze our extensions using both probabilistic analysis and simulations. The algorithms derived appear to achieve much better load balancing.
|
 Additional Information
|
Index Terms- Distributed information systems, Combinatorial mathematics, Distributed algorithms, Load modeling
Citation:
Garret Swart,
"Spreading the Load Using Consistent Hashing: A Preliminary Report,"
ispdc,
pp. 169-176,
Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04),
2004
|
