Statistical Analysis of the Generalized Processor Sharing Scheduling Discipline

Zhi Li Zhang, Don Towsley, Jim Kurose

Research output: Contribution to journalArticlepeer-review

112 Scopus citations


In this paper, we develop bounds on the individual session backlog and delay distribution under the generalized processor sharing (GPS) scheduling discipline. This work is motivated by, and is an extension of, Parekh and Gallager's deterministic study of the GPS scheduling discipline with leaky-bucket token controlled sessions [15], [16]. Using the exponentially bounded burstiness (E.B.B.) process model introduced in [18] as a source traffic characterization, we establish results that extend the deterministic study of GPS: For a single GPS server in isolation, we present statistical bounds on the distributions of backlog and delay for each session. In the network setting, we show that networks belonging to a broad class of GPS assignments, the so-called consistent relative session treatment (CRST) GPS assignments, are stable in a stochastic sense. In particular, we establish simple bounds on the distribution of backlog and delay for each session in a rate proportional processor sharing (RPPS) GPS network with arbitrary topology.

Original languageEnglish (US)
Pages (from-to)1071-1080
Number of pages10
JournalIEEE Journal on Selected Areas in Communications
Issue number6
StatePublished - Aug 1995

Bibliographical note

Funding Information:
Manuscript received September 30, 1994; revised April 1, 1995. This work was supported in part by NSF Grant NCR-9116183, An earlier version of this paper was presented in part at the ACM SIGCOMM ’95 Conference, London, U.K., August 31, 1994. The authors are with the Department of Computer Science, University of Massachusetts, Amherst, MA 01003 USA. IEEE Log Number 9412656.


Dive into the research topics of 'Statistical Analysis of the Generalized Processor Sharing Scheduling Discipline'. Together they form a unique fingerprint.

Cite this