Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T15:40:41.629Z Has data issue: false hasContentIssue false

Stationary increments in the accumulated work process in processor-sharing queues

Published online by Cambridge University Press:  14 July 2016

R. D. Foley*
Affiliation:
Georgia Institute of Technology
Georgia-Ann Klutke*
Affiliation:
University of Massachusetts
*
∗ Postal address: Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332–0205, USA.
∗∗ Present address: Department of Mechanical Engineering. The University of Texas at Austin, Austin, TX 78712–1063, USA.

Abstract

We present a new approach to the processor-sharing queue that allows us to study the accumulated work process of a job that requires an amount of processing time x. Our approach simplifies the proofs of some earlier results on expected conditional response times and extends them to the M/G/φ (·) class. The approach illuminates some of the paradoxical features of these systems.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1989 

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.)

Article purchase

Temporarily unavailable