000			04124nam a22004098i 4500
001			CR9781139226424
005			20250919142045.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			120104s2013||||enk o ||1 0|eng|d
020			_a9781139226424 (ebook)
020			_z9781107027503 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.545 _b.H37 2013
082	0	0	_a519.8/2 _223
100	1		_aHarchol-Balter, Mor, _d1966- _eauthor.
245	1	0	_aPerformance modeling and design of computer systems : _bqueueing theory in action / _cMor Harchol-Balter, Carnegie Mellon University, Pennsylvania.
246	3		_aPerformance modeling & design of computer systems
264		1	_aCambridge : _bCambridge University Press, _c2013.
300			_a1 online resource (xxiii, 548 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	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.
520			_aTackling 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.
650		0	_aTransaction systems (Computer systems) _xMathematical models.
650		0	_aComputer systems _xDesign and construction _xMathematics.
650		0	_aQueuing theory.
650		0	_aQueuing networks (Data transmission)
776	0	8	_iPrint version: _z9781107027503
856	4	0	_uhttps://doi.org/10.1017/CBO9781139226424
907			_a.b16845912 _b2020-12-22 _c2020-12-22
942			_n0
998			_a1 _b2020-12-22 _cm _da _feng _genk _y0 _z.b16845912
999			_c651934 _d651934