Performance modeling and design of computer systems : queueing theory in action / Harchol-Balter, Mor
By: Harchol-Balter, Mor.
Material type:
TextPublisher: Cambridge : Cambridge University Press, 2013Description: xxiii, 548 pages : illustrations ; 26 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9781107027503 (hardback).Subject(s): Transaction systems (Computer systems) -- School of Pure and Applied Sciences | Computer systems -- School of Pure and Applied Sciences | Queuing theory. -- School of Pure and Applied Sciences | Queuing networks (Data transmission) -- School of Pure and Applied Sciences | COMPUTERS / General. -- School of Pure and Applied SciencesDDC classification: QA 76.545 QA 76.545 Other classification: COM000000 Online resources: Contributor biographical information | Publisher description | Table of contents only | Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Long Loan Book
|
Kirinyaga University Library General Stacks | Non-fiction | QA 76.545 .H37 2013 (Browse shelf) | Available | KYU/2021/8083 | ||
|
Long Loan Book
|
Kirinyaga University Library General Stacks | Non-fiction | QA 76.545 .H37 2013 (Browse shelf) | Available | KYU/2021/8084 |
Includes bibliographical references (pages 531-539) and index.
Machine generated contents note: 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.
"Computer systems design is full of conundrums. 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"-- Provided by publisher.