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
- 14 Server Farms: M/M/k and M/M/k/k
- 15 Capacity Provisioning for Server Farms
- 16 Time-Reversibility and Burke's Theorem
- 17 Networks of Queues and Jackson Product Form
- 18 Classed Network of Queues
- 19 Closed Networks of Queues
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- Bibliography
- Index
15 - Capacity Provisioning for Server Farms
from V - Server Farms and Networks: Multi-server, Multi-queue Systems
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
- 14 Server Farms: M/M/k and M/M/k/k
- 15 Capacity Provisioning for Server Farms
- 16 Time-Reversibility and Burke's Theorem
- 17 Networks of Queues and Jackson Product Form
- 18 Classed Network of Queues
- 19 Closed Networks of Queues
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- Bibliography
- Index
Summary
If servers were free, then every server farm would have an infinite number of servers, and no job would ever have to wait in a queue. Unfortunately, servers are not free to buy, and they are also not free to operate. Running servers consumes lots of power, and even leaving a server on, but idle, still consumes nearly 60% of the power consumed by a busy server [15]. Given these costs, it pays to spend some time thinking about how many servers one really needs. This subject is called capacity provisioning.
Observe that we can actually already, in theory, answer the question of how many servers we need to achieve a given Quality of Service (QoS) goal, based on the formulas we derived in Chapter 14. In that chapter, we considered the M/M/k server farm model and derived expressions for the distribution of the number of jobs in the system, the probability of queueing, PQ, and the expected response time, E[T]. Given a QoS constraint on E[T] or PQ, we can iterate over these formulas and deduce the exact number of servers, k, needed to achieve the desired constraint.
However, iterating over a formula is time consuming and also does not provide any intuitions for the result. The purpose of this chapter is to formulate intuitions and rules of thumb for understanding how many servers we need to achieve a certain QoS goal, and what the impact is of increasing the number of servers.
- Type
- Chapter
- Information
- Performance Modeling and Design of Computer SystemsQueueing Theory in Action, pp. 269 - 281Publisher: Cambridge University PressPrint publication year: 2013