Join-the-Idle-Queue Meets the Power-of-d-Choices
暂无分享,去创建一个
[1] Michael Mitzenmacher. Analyzing distributed Join-Idle-Queue: A fluid limit approach , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[2] R. Srikant,et al. The Power of Slightly More than One Sample in Randomized Load Balancing , 2017, Math. Oper. Res..
[3] R. Srikant,et al. Asymptotically tight steady-state queue length bounds implied by drift conditions , 2011, Queueing Syst. Theory Appl..
[4] Julian Cheng,et al. Distributed Join-the-Idle-Queue for Low Latency Cloud Services , 2018, IEEE/ACM Transactions on Networking.
[5] Alexander L. Stolyar. Pull-based load distribution in large-scale heterogeneous service systems , 2015, Queueing Syst. Theory Appl..
[6] Patrick Wendell,et al. Sparrow: distributed, low latency scheduling , 2013, SOSP.
[7] Alexander L. Stolyar. Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers , 2017, Queueing Syst. Theory Appl..
[8] Michael Mitzenmacher,et al. The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..
[9] James R. Larus,et al. Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services , 2011, Perform. Evaluation.