Robert Gieroba, Łukasz Kruk, "Minimality of SRPT Networks with Resource Sharing," WSEAS Transactions on Mathematics, vol. 20, pp. 74-83, 2021, DOI:10.37394/23206.2021.20.8
Robert Gieroba, Łukasz Kruk. Minimality of SRPT Networks with Resource Sharing.
WSEAS Transactions on Mathematics. 2021;20:74-83. 10.37394/23206.2021.20.8
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 20, 2021
Minimality of SRPT Networks with Resource Sharing
Authors: ,
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.
Keywords:
Queuing, resource sharing, SRPT, minimality, residual file sizes, partial ordering, service protocols
Pages: 74-83 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 20, 2021, Art. #8 DOI: 10.37394/23206.2021.20.8
×
Citation Tools