Work2004

Quantifying the properties of SRPT scheduling

25 citations0/0 files storedProceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

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 Cloud Computing and Resource Management

Abstract

This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as processor sharing (PS) and shortest remaining processing time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, service time distributions, and scheduling policies. In the paper, we apply the approach to trace-driven simulation of Web server scheduling to compare and contrast the PS and SRPT scheduling policies. We identify two types of unfairness, called endogenous and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown, conditioned on job size, for a range of system loads. Finally, we confirm recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrate typical performance results for a practical range of job sizes from an empirical Web server workload.

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 — 25 citations exist upstream.

References

1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline 2001Analysis of SRPT scheduling 2002Asymptotic convergence of scheduling policies with respect to slowdown 1978Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline 1990The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time

Cited by

2004Simulation evaluation of hybrid srpt scheduling policies 2005Nearly insensitive bounds on SMART scheduling 2005Revisiting unfairness in Web server scheduling

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.