Affiliation:
1. Department of Mathematics, Maria Curie-skłodowska University, Pl. Marii Curie-skłodowskiej 1, 20-031 Lublin, Poland
Abstract
A general multi-resource network with users requiring service from a number of shared resources simultaneously is considered. It is demonstrated that the Shortest Remaining Processing Time (SRPT) service protocol minimizes, in a suitable sense, the system resource idleness with respect to customers with residual service times not greater than any threshold value on every network route. Our arguments are pathwise, with no assumptions on the model stochastic primitives and the network topology.
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Reference20 articles.
1. L. E. Schrage, L. W. Miller, The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14 (1966), 670-684.
2. L. E. Schrage, A proof of the optimality of the shortest remaining processing time discipline. Operations Research 16 (1968), 687-690.
3. F. Schreiber, Properties and applications of the optimal queueing strategy SRPT: a survey. Archiv für Elektronik und Übertragungstechnik, 47 (1993), 372-378.
4. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/G/1. In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 238– 249, 2003.
5. R. Núñez-Queija, Queues with equally heavy sojourn time and service requirement distributions. Annals of Operations Research 113 (2002), 101- 117.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献