000			03929cam a2200313 i 4500
001			32358
005			20230423231424.0
008			140909s2013 enka b 001 0 eng
020			_a9781107027503 (hardback)
049			_bPITLIB
050	0	0	_aQA76.545 _b.H37 2013
100	1		_aHarchol-Balter, Mor, _d1966- _941970
245	1	0	_aPerformance modeling and design of computer systems : _bqueueing theory in action / _cMor Harchol-Balter, Carnegie Mellon University, Pennsylvania _h[book]
260		1	_aCambridge : _bCambridge University Press, _c2013. _94065
300			_axxiii, 548 pages : _billustrations
449		0	_a•u005– New Arrivals- Sep. 2014
504			_aIncludes bibliographical references (pages 531-539) and index
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			_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"-- _cProvided by publisher.
650		0	_aTransaction systems (Computer systems) _xMathematical models. _920860
650		0	_aComputer systems _xMathematics. _xMathematics. _941971
650		0	_aQueuing theory. _941972
650		0	_aQueuing networks (Data transmission) _941973
650		7	_aCOMPUTERS / General. _2bisacsh _941974
690		0	_a0023 วิศวกรรมศาสตรบัณฑิต สาขาวิศวกรรมคอมพิวเตอร์ CPE (ป.ตรี) _965
942			_cBK
988			_c32358
999			_c32358 _d32358