Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Performance Modeling and Design of Computer Systems
Queueing Theory in Action

$75.00 (Z)

textbook
  • Date Published: February 2013
  • availability: In stock
  • format: Hardback
  • isbn: 9781107027503
Average user rating
(1 review)

$75.00 (Z)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Request examination copy

Instructors may request a copy of this title for examination

Description
Product filter button
Description
Contents
Resources
About the Authors
  • 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.

    • Fun and readable, the book is approachable, even for undergraduates, while still being rigorous and covering a wider span of topics than many queueing books
    • Brings queueing theory decisively back to computer science through a lively mix of motivation, intuition, illustrations, examples and over 300 exercises
    • Readers acquire the skills needed to model, analyze and design large-scale systems with good performance and low cost
    Read more

    Customer reviews

    25th Sep 2013 by GURU

    This is very helpful to understand my syllabus

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2013
    • format: Hardback
    • isbn: 9781107027503
    • length: 569 pages
    • dimensions: 260 x 183 x 30 mm
    • weight: 1.15kg
    • contains: 215 b/w illus. 11 tables 300 exercises
    • availability: In stock
  • Table of Contents

    Part I. Introduction to Queueing:
    1. Motivating examples
    2. Queueing theory terminology
    Part II. Necessary Probability Background:
    3. Probability review
    4. Generating random variables
    5. Sample paths, convergence, and averages
    Part III. The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers:
    6. Operational laws
    7. Modification analysis
    Part IV. From Markov Chains to Simple Queues:
    8. Discrete-time Markov Chains
    9. Ergodicity theory
    10. Real-world examples: Google, Aloha
    11. Generating functions for Markov Chains
    12. Exponential distributions and Poisson Process
    13. Transition to continuous-time Markov Chains
    14. M/M/1 and PASTA
    Part V. Server Farms and Networks: Multi-server, Multi-queue Systems:
    15. Server farms: M/M/k and M/M/k/k
    16. Capacity provisioning for server farms
    17. Time-reversibility and Burke's Theorem
    18. Jackson network of queues
    19. Classed network of queues
    20. Closed networks of queues
    Part VI. Real-World Workloads: High-Variability and Heavy Tails:
    21. Tales of tails: real-world workloads
    22. Phase-type workloads and matrix-analytic
    23. Networks of time-sharing (PS) servers
    24. M/G/I queue and inspection paradox
    25. Task assignment for server farms
    26. Transform analysis
    27. M/G/I transform analysis
    28. Power optimization application
    Part VII. Smart Scheduling:
    29. Performance metrics
    30. Non-preemptive, non-size-based policies
    31. Preemptive, non-size-based policies
    32. Non-preemptive, size-based policies
    33. Preemptive, size-based policies
    34. Scheduling: SRPT and fairness.

  • Author

    Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania
    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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

Join us online

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×