04046cam a2200361 i 450000100090000000300090000900500170001800800410003502000150007602000190009104000330011008200200014310000480016324501500021126400640036130000470042533600260047233700280049833800270052650400520055350516170060552010000222265000720322265000670329465000270336165000480338865100100343665300230344665500170346994200120348699900170349895201690351517312104EG-ScBUE20241221100559.0120521s2013    enka   f b   f001 0 eng d  a1107027500  a9781107027503   aDLCbengerdacDLCdEG-ScBUE04a519.82222bHAR1 aHarchol-Balter, Mor,d1966-eauthor.93838410aPerformance modeling and design of computer systems :bqueueing theory in action /cMor Harchol-Balter, Carnegie Mellon University, Pennsylvania. 1aCambridge ;aNew York :bCambridge University Press,c2013.  axxiii, 548 pages :billustrations ;c26 cm  2rdacontentatextbtxt  2rdamediaaunmediatedbn  2rdacarrieravolumebnc  aIncludes bibliographical references and index.
8 aMachine 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.  a"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"-- 7aTransaction systems (Computer systems)xMathematical models.2BUEsh 7aComputer systemsxDesign and constructionxMathematics.2BUEsh 7aQueuing theory.2BUEsh 7aQueuing networks (Data transmission)2BUEsh  2BUEsh  bCOMSCIcAugust2015  vReading book  2ddccBB  c20545d20517  00102ddc40708BaccahaMAINbMAINc1STd2015-08-17ePurchaseg672.00h21759l2m12o519.82 HARp000030772r2026-02-02 00:00:00s2025-11-27v840.00w2015-08-17yBB