Beyond processor sharing

Samuli Aalto A · Urtzi Ayesta · Sem C. Borst · Vishal Misra · R. Núñez Queija

62 citations0/0 files storedACM SIGMETRICS Performance Evaluation Review

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Real-Time Systems Scheduling

Abstract

While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the performance of fair resource allocation mechanisms, it is inherently limited in analyzing and designing differentiated scheduling algorithms such as Weighted Fair Queueing and Weighted Round-Robin. The Discriminatory Processor-Sharing (DPS) and Generalized Processor-Sharing (GPS) disciplines have emerged as natural generalizations for modeling the performance of such service differentiation mechanisms. A further extension of the ordinary PS policy is the Multilevel Processor-Sharing (MLPS) discipline, which has captured a pivotal role in the analysis, design and implementation of size-based scheduling strategies. We review various key results for DPS, GPS and MLPS models, highlighting to what extent these disciplines inherit desirable properties from ordinary PS or are capable of delivering service differentiation.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 62 citations exist upstream.

References

1967Time-shared Systems 1977Queueing Systems, Vol. II: Computer Applications.1983Boundary Value Problems in Queueing System Analysis 1979The multiple phase service network with generalized processor sharing 1987Processor-sharing queues: Some progress in analysis 1980Sharing a Processor Among Many Job Classes 2006A survey on discriminatory processor sharing 2000Sojourn time asymptotics in the M/G/1 processor sharing queue

Cited by

2011PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING 2018SOAP 2012Minimizing slowdown in heterogeneous size-aware dispatching systems 2011Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing 2018SOAP 2012Minimizing slowdown in heterogeneous size-aware dispatching systems 2017Whittle indexability in egalitarian processor sharing systems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.