DMCA
Predicting response times in processor-sharing queues (2000)
| Venue: | In Proc. of the Fields Institute Conf. on Comm. Networks |
| Citations: | 15 - 2 self |
BibTeX
@INPROCEEDINGS{Ward00predictingresponse,
author = {Amy R. Ward and Ward Whitt},
title = {Predicting response times in processor-sharing queues},
booktitle = {In Proc. of the Fields Institute Conf. on Comm. Networks},
year = {2000},
pages = {1--29},
publisher = {Society}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We investigate the possibility of reliably predicting response times in real time (e.g., at the time a job arrives) in the M/G/1 processor-sharing queue. The proposed prediction is the conditional mean given current state information. We consider several forms of state information, always including the remaining service requirement of the job of interest and the number of other jobs in the system. We consider three cases for the other jobs ’ service requirements: First, we assume that all the remaining service requirements are known; second, we assume that the amount of completed work of each customer in service is known; and third, we assume that nothing more is known. We thus are able to study the value of different kinds of information. We calculate the conditional mean and variance of the response time, given the state information, by numerically inverting Laplace transforms. We evaluate the reliability by looking at the ratio of the standard
