Start Over Save to list Export MARC Display MelCat
     
book jacket

Find in WorldCat
View Library Guide - Computer Science
Author Harchol-Balter, Mor, 1966-
Title Performance modeling and design of computer systems [electronic resource] : queueing theory in action / Mor Harchol-Balter.
Location Call No. Status Notes
 Libraries Electronic Books  ELECTRONIC BOOKS-DDA    AVAIL. ONLINE
Description 1 online resource.
Note Description based on print version record.
Bibliography Includes bibliographical references and index.
Contents 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.
Reproduction Electronic reproduction. Perth, W.A. Available via World Wide Web.
Note Description based on print version record.
Subject Transaction systems (Computer systems) -- Mathematical models.
Computer systems -- Design and construction -- Mathematics.
Queuing theory.
Queuing networks (Data transmission)
Added Author Ebooks Corporation
Related To Original 9781107027503 1107027500 (DLC) 2012019844
ISBN 1139612697 (electronic bk.)
9781139612692 (electronic bk.)
9781107027503
1107027500
Permanent url for this catalog record: