Skip to content

Performance Modeling and Design of Computer Systems Queueing Theory in Action

Spend $50 to get a free DVD!

ISBN-10: 1107027500

ISBN-13: 9781107027503

Edition: 2012

Authors: Mor Harchol-Balter

List price: $57.00
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $57.00
Copyright year: 2012
Publisher: Cambridge University Press
Publication date: 2/18/2013
Binding: Hardcover
Pages: 576
Size: 7.25" wide x 10.25" long x 1.00" tall
Weight: 2.530
Language: English

Mor Harchol-Balter is an Associate Professor in the Computer Science Department at Carnegie Mellon University. She is a recipient of the McCandless Chair, the NSF CAREER award, the NSF Postdoctoral Fellowship in the Mathematical Sciences, multiple best paper awards, and several teaching awards, including the Herbert A. Simon Award for Teaching Excellence and the campus-wide Teaching Effectiveness Award. She is a leader in the ACM SIGMETRICS/Performance community, for which she recently served as Technical Program Chair, and has served on the Technical Program Committee twelve times. Harchol-Balter's work integrates queueing theoretic analysis with low-level computer systems implementation. Her research is on designing new resource allocation policies (load balancing policies, power management policies, and scheduling policies) for server farms and distributed systems in general, where she emphasizes integrating measured workload distributions into the problem solution.

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