Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T09:20:05.105Z Has data issue: false hasContentIssue false
  • English
  • Français

Conditional response times in the M/G/1 processor-sharing system

Published online by Cambridge University Press:  14 July 2016

B. K. Asare  and
F. G. Foster
B. K. Asare*
Affiliation:
Trinity College, Dublin
F. G. Foster*
Affiliation:
Trinity College, Dublin
*
∗ Postal address: Department of Statistics, Trinity College, Dublin 2, Ireland.
∗ Postal address: Department of Statistics, Trinity College, Dublin 2, Ireland.
Get access Rights & Permissions [Opens in a new window]

Abstract

The expected response time of a job that requires processing time t and meets n jobs on arrival in the M/G/1 processor-sharing system is derived.

Keywords

JOBPROCESSING TIMEOPERATING SYSTEMRESPONSE TIME
Type
Short Communications
Information
Journal of Applied Probability , Volume 20 , Issue 4 , December 1983 , pp. 910 - 915
Copyright
Copyright © Applied Probability Trust 1983 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Beneš, V. E. (1957) On queues with Poisson arrivals. Ann. Math. Statist. 28, 670–677.Google Scholar
[2] Brumelle, S. L. (1978) A generalization of Erlang's loss system to state dependent arrival and service rates. Math. Operat. Res. 3, 10–16.CrossRefGoogle Scholar
[3] Coffman, E. G., Muntz, R. R. and Trotter, H. (1970) Waiting time distributions for processor-sharing systems. J. Assoc. Comput. Mach. 17, 123–130.Google Scholar
[4] Foster, F. G. (1973) Stochastic processes. In Operational Research '72, ed. Ross, M., North-Holland, Amsterdam, 223–239.Google Scholar
[5] Kleinrock, L. (1967) Time-shared systems: a theoretical treatment. J. Assoc. Comput. Mach. 14, 242–261.Google Scholar
[6] Kleinrock, L. (1976) Queuing Systems, Vol. 2. Wiley, New York.Google Scholar
[7] Little, J. D. C. (1961) A proof of the queueing formula L = ? W. Operat. Res. 9, 383–387.Google Scholar
[8] O'donovan, T. M. (1974) Direct solutions of M/G/1 processor-sharing models. Operat. Res. 22, 1232–1235.CrossRefGoogle Scholar
[9] O'donovan, T. M. (1976) Conditional response time in M/M/1 processor-sharing models. Operat. Res. 24, 382–385.Google Scholar
[10] Sakata, M., Noguchi, S. and Oizumi, J. (1968) Analysis of a processor-shared queueing model for time-sharing systems. Proc. 2nd Hawaii Internat. Conf. Systems Sciences, 625–628.Google Scholar
[11] Sakata, M., Noguchi, S. and Oizumi, J. (1971) An analysis of the M/G/1 queue under round-robin scheduling. Operat. Res. 19, 371–385.Google Scholar