On the power of two choices: Balls and bins in continuous time
暂无分享,去创建一个
[1] Colin McDiarmid,et al. On the maximum queue length in the supermarket model , 2004 .
[2] Berthold Vöcking,et al. How asymmetry helps load balancing , 1999, JACM.
[3] M. Habib. Probabilistic methods for algorithmic discrete mathematics , 1998 .
[4] S. Turner,et al. The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.
[5] S. Boucheron,et al. BINS AND BALLS: LARGE DEVIATIONS OF THE EMPIRICAL OCCUPANCY PROCESS , 2002 .
[6] R. L. Dobrushin,et al. Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .
[7] Michael Mitzenmacher,et al. The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..
[8] S. Ethier,et al. Markov Processes: Characterization and Convergence , 2005 .
[9] Carl Graham,et al. Kinetic Limits for Large Communication Networks , 2000 .
[10] C. Cercignani. The Boltzmann equation and its applications , 1988 .
[11] Berthold Vöcking,et al. Balanced allocations: the heavily loaded case , 2000, STOC '00.
[12] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[13] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[14] Eli Upfal,et al. On-line routing of random calls in networks , 2003 .
[15] C. McDiarmid. Concentration , 1862, The Dental register.
[16] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[17] C. Graham,et al. Chaos hypothesis for a system interacting through shared resources , 1994 .
[18] Pierre Del Moral. Propagation of Chaos , 2004 .
[19] Michael Mitzenmacher,et al. Studying Balanced Allocations with Differential Equations , 1999, Combinatorics, Probability and Computing.
[20] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.