Subject 
Transaction systems (Computer systems)  Mathematical models.


Computer systems  Design and construction  Mathematics.


Queuing theory.


Queuing networks (Data transmission)

Description 
1 online resource (xxiii, 548 pages) : illustrations 
Summary 
"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 largescale systems with good performance and low cost. The exercises are an important feature, teaching researchlevel 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. 
Bibliography Note 
Includes bibliographical references (pages 531539) and index. 
Contents 
I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology  II. Necessary Probability Background: 3. Probability review; 4. Generating random variables for simulation; 5. Sample paths, convergence, and averages  Part III. The Predictive Power of Simple Operational Laws: 'WhatIf' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "whatif" for closed systems  Part IV. From Markov Chains to Simple Queues: 8. Discretetime Markov Chains; 9. Ergodicity theory; 10. Realworld examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuoustime Markov Chains; 13. M/M/I and PASTA  V. Server Farms and Networks: Multiserver, Multiqueue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Timereversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues  VI. RealWorld Workloads: HighVariability and Heavy Tails: 20. Tales of tails: realworld workloads; 21. Phasetype workloads and matrixanalytic methods; 22. Networks with timesharing (PS) servers (BCMP); 23. The M/G/I queue and inspection paradox; 24. Task assignment for server farms; 25. Transform analysis; 26. M/G/I transform analysis; 27. Power optimization application  VII. Smart Scheduling in the M/G/I: 28. Performance metrics; 29. Scheduling: nonpreemptive, nonsizebased policies; 30. Scheduling: preemptive, nonsizebased policies; 31. Scheduling: nonpreemptive, sizebased policies; 32. Scheduling: preemptive, sizebased policies; 33. Scheduling: SRPT and fairness. 
Note 
Print version record. 
ISBN 
9781139616416 (electronic bk.) 

1139616412 (electronic bk.) 

9781139610834 (electronic bk.) 

113961083X (electronic bk.) 

9781139625715 (electronic bk.) 

1139625713 (electronic bk.) 

9781139226424 (electronic bk.) 

1139226428 (electronic bk.) 

9781139612692 (electronic bk.) 

1139612697 (electronic bk.) 

9781107027503 (hardback) 

1107027500 (hardback) 
OCLC # 
828302647 
Additional Format 
Print version: HarcholBalter, Mor, 1966 Performance modeling and design of computer systems. Cambridge : Cambridge University Press, 2013 9781107027503 (DLC) 2012019844 (OCoLC)795763742. 
