IBM Research Report Optimal Probabilistic Routing in Distributed Parallel Queues

[1]  Mark S. Squillante,et al.  Analysis of task migration in shared-memory multiprocessor scheduling , 1991, SIGMETRICS '91.

[2]  Avishai Mandelbaum,et al.  Strong Approximations for Time-Dependent Queues , 1995, Math. Oper. Res..

[3]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[4]  Mor Harchol-Balter,et al.  Task assignment in a distributed system (extended abstract): improving performance by unbalancing load , 1997, SIGMETRICS '98/PERFORMANCE '98.

[5]  Mark S. Squillante,et al.  MATRIX-ANALYTIC ANALYSIS OF A MAP/PH/1 QUEUE FITTED TO WEB SERVER DATA , 2002 .

[6]  I. B. Russak,et al.  Manifolds , 2019, Spacetime and Geometry.

[7]  Guerney D. H. Hunt,et al.  Network Dispatcher: A Connection Router for Scalable Internet Services , 1998, Comput. Networks.

[8]  Sem C. Borst.  Optimal probabilistic allocation of customer types to servers , 1995, SIGMETRICS '95/PERFORMANCE '95.

[9]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[10]  Mor Harchol-Balter.  Task assignment with unknown duration , 2002, JACM.

[11]  P. Sparaggis,et al.  Minimizing response times and queue lengths in systems of parallel queues , 1999 .

[12]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[13]  Teunis J. Ott,et al.  Load-balancing heuristics and process behavior , 1986, SIGMETRICS '86/PERFORMANCE '86.

[14]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[15]  Yung-Terng Wang,et al.  Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.

[16]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[17]  Susan H. Xu,et al.  Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System , 1997, Oper. Res..

[18]  Hui Wang,et al.  First passage times of a jump diffusion process , 2003, Advances in Applied Probability.

[19]  Daniel M. Dias,et al.  A scalable and highly available web server , 1996, COMPCON '96. Technologies for the Information Superhighway Digest of Papers.

[20]  Anurag Kumar,et al.  Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler , 1990, IEEE Trans. Computers.

[21]  David D. Yao,et al.  Optimal load balancing and scheduling in a distributed computer system , 1991, JACM.

[22]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[23]  M. Reiman,et al.  Fluid and diffusion limits for queues in slowly changing environments , 1997 .

[24]  Wayne L. Winston.  OPTIMALITY OF THE SHORTEST LINE DISCIPLINE , 1977 .

[25]  David D. Yao,et al.  Fundamentals of Queueing Networks , 2001 .

[26]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[27]  Mark S. Squillante,et al.  Optimal stochastic scheduling in multiclass parallel queues , 1999, SIGMETRICS '99.

[28]  P. Billingsley,et al.  Convergence of Probability Measures , 1970, The Mathematical Gazette.

[29]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..