Abstract
The customer response times in the egalitarian processor sharing queue are shown to be associated random variables under renewal inputs and general independent service times assumptions.
Similar content being viewed by others
References
F. Baccelli, E. Gelenbe and B. Plateau An end to end approach to the resequencing problem, J. ACM 31(3) (1984) 474–485.
F. Baccelli, A queueing model of timestamp ordering in a distributed system,Proc. Performance'87, Bruxelles (North-Holland, 1987) pp. 413–431.
F. Baccelli, W. Massey and D. Towsley, Acyclic Fork-Join queueing networks, J. ACM 36(3) (1989) 615–642.
F. Baccelli and A. Makowski, Queueing models for systems with synchronization constraints, Proc. IEEE 77(1) (1989) 138–161.
R.E. Barlow and F. Proschan,Statistical Theory of Reliability and Life Testing (McArdle Press, 1981).
G. Fayolle, I. Mitrani and R. Iasnogorodski, Sharing a processor among many job classes, J. ACM 27(3) (1980) 519–532.
R.M. Loynes, The stability of queues with non-independent inter-arrival and service times, Proc. Cambridge Phil. Soc. 58 (1962) 497–520.
Yashkov, Processor sharing queues: some progress in analysis, Queueing Systems 2 (1987) 1–17.
Author information
Authors and Affiliations
Additional information
The work by this author was supported in part by the National Science Foundation under grant ASC 88-8802764 and by the Office of Naval Research under grant ONR N00014-87-K-0796.
Rights and permissions
About this article
Cite this article
Baccelli, F., Towsley, D. The customer response times in the processor sharing queue are associated. Queueing Syst 7, 269–282 (1990). https://doi.org/10.1007/BF01154546
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01154546