Load Balancing White Papers
Load Balancing and Locality in Range-Queriable Data Structures
Overview This paper describes a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing with respect to an arbitrary load measure specified by the user and geographical locality, assigning elements with similar keys to the same server. Though this mechanism is specifically designed to improve the performance of skip graphs, it can be adapted to provide deterministic, locality-preserving load-balancing to any distributed data structure that orders machines in a ring or line.
| Publisher | Association for Computing Machinery | File Format | |
|---|---|---|---|
| Date Published | July 2004 | ||
| Format | White Papers | ||
| Topics | |||



