Work2004

Simulation evaluation of hybrid srpt scheduling policies

22 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 Distributed and Parallel Computing Systems

Abstract

This paper uses trace-driven simulations to evaluate two novel Web server scheduling policies called K-SRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (shortest remaining processing time) that can have up to K jobs in service at a time. T-SRPT is a hybrid policy that dynamically switches from PS (processor sharing) to SRPT when the number of jobs in the system exceeds T, and back to PS when the load diminishes. Slowdown profile plots are used to analyze the performance of these policies relative to PS, SRPT, and FSP (fair sojourn protocol). Simulation results show that these new parameterized policies offer smooth performance tradeoffs between SRPT and PS. Stability issues for T-SRPT are also discussed.

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

References

1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline 2001Analysis of SRPT scheduling 2003Classifying scheduling policies with respect to unfairness in an M/GI/1 2002Asymptotic convergence of scheduling policies with respect to slowdown 2004A resource-allocation queueing fairness measure 2003Fairness and efficiency in web server protocols 2004Quantifying the properties of SRPT scheduling

Cited by

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.