Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- I Introduction to Queueing
- II Necessary Probability Background
- III The Predictive Power of Simple Operational Laws: “What-If” Questions and Answers
- IV From Markov Chains to Simple Queues
- V Server Farms and Networks: Multi-server, Multi-queue Systems
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- 28 Performance Metrics
- 29 Scheduling: Non-Preemptive, Non-Size-Based Policies
- 30 Scheduling: Preemptive, Non-Size-Based Policies
- 31 Scheduling: Non-Preemptive, Size-Based Policies
- 32 Scheduling: Preemptive, Size-Based Policies
- 33 Scheduling: SRPT and Fairness
- Bibliography
- Index
30 - Scheduling: Preemptive, Non-Size-Based Policies
from VII - Smart Scheduling in the M/G/1
Published online by Cambridge University Press: 05 February 2013
- Frontmatter
- Contents
- Preface
- Acknowledgments
- I Introduction to Queueing
- II Necessary Probability Background
- III The Predictive Power of Simple Operational Laws: “What-If” Questions and Answers
- IV From Markov Chains to Simple Queues
- V Server Farms and Networks: Multi-server, Multi-queue Systems
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- 28 Performance Metrics
- 29 Scheduling: Non-Preemptive, Non-Size-Based Policies
- 30 Scheduling: Preemptive, Non-Size-Based Policies
- 31 Scheduling: Non-Preemptive, Size-Based Policies
- 32 Scheduling: Preemptive, Size-Based Policies
- 33 Scheduling: SRPT and Fairness
- Bibliography
- Index
- Type
- Chapter
- Information
- Performance Modeling and Design of Computer SystemsQueueing Theory in Action, pp. 482 - 498Publisher: Cambridge University PressPrint publication year: 2013