Balanced allocations with heterogenous bins
暂无分享,去创建一个
[1] Berthold Vöcking,et al. Balanced allocations: the heavily loaded case , 2000, STOC '00.
[2] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[3] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[4] Kunal Talwar,et al. Balanced allocations: the weighted case , 2007, STOC '07.
[5] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[6] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[7] Berthold Vöcking,et al. How asymmetry helps load balancing , 1999, JACM.
[8] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[9] Junfeng Yang,et al. Kinesis: A new approach to replica placement in distributed storage systems , 2009, TOS.
[10] Gurmeet Singh Manku,et al. Balanced binary trees for ID management and load balance in distributed hash tables , 2004, PODC '04.
[11] Moni Naor,et al. Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.
[12] Martin Raab,et al. "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.
[13] Micah Adler,et al. Parallel randomized load balancing , 1995, STOC '95.
[14] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.
[15] Friedhelm Meyer auf der Heide,et al. Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.
[16] Jeffrey Considine,et al. Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.
[17] David R. Karger,et al. Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2004, SPAA '04.
[18] Jeffrey Considine,et al. Geometric generalizations of the power of two choices , 2004, SPAA '04.