Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
暂无分享,去创建一个
[1] M. D. Kirszbraun. Über die zusammenziehende und Lipschitzsche Transformationen , 1934 .
[2] F. G. Foster. On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .
[3] W. Rudin. Principles of mathematical analysis , 1964 .
[4] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[5] T. Kurtz. Approximation of Population Processes , 1987 .
[6] Aleksej F. Filippov,et al. Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.
[7] John N. Tsitsiklis,et al. Optimal distributed policies for choosing among multiple servers , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.
[8] O. Smolyanov,et al. Ordinary differential equations in locally convex spaces , 1994 .
[9] T. Kurtz,et al. Large loss networks , 1994 .
[10] Alan Weiss,et al. Large Deviations For Performance Analysis: Queues, Communication and Computing , 1995 .
[11] R. L. Dobrushin,et al. Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .
[12] Maury Bramson,et al. State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..
[13] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[14] Michael Mitzenmacher,et al. The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..
[15] J. Tsitsiklis,et al. Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions , 2001 .
[16] Devavrat Shah,et al. Load balancing with memory , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[17] Mark Burgess,et al. Dynamic pull-based load balancing for autonomic servers , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.
[18] Yury Makarychev,et al. Balanced Allocation: Memory Performance Tradeoffs , 2009, ArXiv.
[19] Noga Alon,et al. Choice-Memory Tradeoff in Allocations , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[20] Yi Lu,et al. Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks , 2011, ArXiv.
[21] James R. Larus,et al. Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services , 2011, Perform. Evaluation.
[22] R. Bass. Convergence of probability measures , 2011 .
[23] John N. Tsitsiklis,et al. On the Power of (Even a Little) Resource Pooling , 2012 .
[24] Christoph Lenzen,et al. Tight bounds for parallel randomized load balancing , 2011, Distributed Computing.
[25] R. Srikant,et al. The power of slightly more than one sample in randomized load balancing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).
[26] Alexander L. Stolyar. Pull-based load distribution in large-scale heterogeneous service systems , 2015, Queueing Syst. Theory Appl..
[27] Sem C. Borst,et al. Universality of Power-of-d Load Balancing Schemes , 2016, PERV.
[28] Michael Mitzenmacher. Analyzing distributed Join-Idle-Queue: A fluid limit approach , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[29] Sem C. Borst,et al. Load balancing in large-scale systems with multiple dispatchers , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.
[30] Alexander L. Stolyar,et al. Large-scale join-idle-queue system with general service times , 2017, J. Appl. Probab..
[31] Alexander L. Stolyar. Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers , 2017, Queueing Syst. Theory Appl..
[32] Kuang Xu,et al. Reinforcement with Fading Memories , 2018, SIGMETRICS.
[33] John N. Tsitsiklis,et al. Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems , 2018 .
[34] Reza Aghajani,et al. The hydrodynamic limit of a randomized load balancing network , 2017, The Annals of Applied Probability.