CART

(0) items

Performance Modeling and Design of Computer Systems : Queueing Theory in Action,9781107027503
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Performance Modeling and Design of Computer Systems : Queueing Theory in Action

by
Edition:
1st
ISBN13:

9781107027503

ISBN10:
1107027500
Format:
Hardcover
Pub. Date:
2/28/2013
Publisher(s):
Cambridge Univ Pr
List Price: $75.00

Rent Textbook

(Recommended)
 
Term
Due
Price
$67.50

Buy New Textbook

Usually Ships in 3-5 Business Days
N9781107027503
$73.13

eTextbook

Downloadable Offline Access
  • Apple Devices
  • Android Devices
  • Kindle Fire
  • Windows Devices
  • Mac Devices
Lifetime Access
$60.67

Used Textbook

We're Sorry
Sold Out

More New and Used
from Private Sellers
Starting at $39.24
See Prices

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 1st edition with a publication date of 2/28/2013.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Summary

Computer systems design is full of conundrums: -Given a choice between a single machine with speed s, or n machines each with speed s/n, which should we choose? -If both the arrival rate and service rate double, will the mean response time stay the same? -Should systems really aim to balance load, or is this a convenient myth? -If a scheduling policy favors one set of jobs, does it necessarily hurt some other jobs, or are these "conservation laws" being misinterpreted? -Do greedy, shortest-delay, routing strategies make sense in a server farm, or is what's good for the individual disastrous for the system as a whole? -How do high job size variability and heavy-tailed workloads affect the choice of a scheduling policy? -How should one trade off energy and delay in designing a computer system? -If 12 servers are needed to meet delay guarantees when the arrival rate is 9 jobs/sec, will we need 12,000 servers when the arrival rate is 9,000 jobs/sec? Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples, and more than 300 exercises - all while acquiring the skills needed to model, analyze, and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own.

Table of Contents

Introduction to Queueing
Motivating examples
Queueing theory terminology
Necessary Probability Background
Probability review
Generating random variables
Sample paths, convergence, and averages
The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers
Operational laws
Modification analysis
From Markov Chains to Simple Queues
Discrete-time Markov Chains
Ergodicity theory
Real-world examples: Google, Aloha
Generating functions for Markov Chains
Exponential distributions and Poisson Process
Transition to continuous-time Markov Chains
M/M/1 and PASTA
Server Farms and Networks: Multi-server, Multi-queue Systems
Server farms: M/M/k and M/M/k/k
Capacity provisioning for server farms
Time-reversibility and Burke's Theorem
Jackson network of queues
Classed network of queues
Closed networks of queues
Real-World Workloads: High-Variability and Heavy Tails
Tales of tails: real-world workloads
Phase-type workloads and matrix-analytic
Networks of time-sharing (PS) servers
M/G/I queue and inspection paradox
Task assignment for server farms
Transform analysis
M/G/I transform analysis
Power optimization application
Smart Scheduling
Performance metrics
Non-preemptive, non-size-based policies
Preemptive, non-size-based policies
Non-preemptive, size-based policies
Preemptive, size-based policies
Scheduling: SRPT and fairness
Table of Contents provided by Publisher. All Rights Reserved.


Please wait while the item is added to your cart...