Handling load with less stress
暂无分享,去创建一个
[1] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .
[2] Mor Harchol-Balter. Task assignment with unknown duration , 2002, JACM.
[3] Vishal Misra,et al. Mixed scheduling disciplines for network flows , 2003, PERV.
[4] J. George Shanthikumar,et al. Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures , 1989, Probability in the Engineering and Informational Sciences.
[5] Nikhil Bansal. On the average sojourn time under M/M/1/SRPT , 2005, Oper. Res. Lett..
[6] Linus Schrage,et al. Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..
[7] S. Wittevrongel,et al. Queueing systems , 2019, Autom..
[8] Sarah Williams,et al. Computer applications , 1988 .
[9] Thomas M. O'Donovan. Technical Note - Distribution of Attained and Residual Service in General Queuing Systems , 1974, Oper. Res..
[10] Adam Wierman,et al. Nearly insensitive bounds on SMART scheduling , 2005, SIGMETRICS '05.
[11] William L. Maxwell,et al. Theory of scheduling , 1967 .
[12] J. Tsitsiklis,et al. On the large deviations behavior of acyclic networks of $G/G/1$ queues , 1998 .
[13] Ronald W. Wolff,et al. Stochastic Modeling and the Theory of Queues , 1989 .
[14] Nikhil Bansal. On the average sojourn time under M/M/1/SRPT , 2003, PERV.
[15] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[16] N. L. Lawrie,et al. Comparison Methods for Queues and Other Stochastic Models , 1984 .