Coverart for item
The Resource Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter

Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter

Label
Performance modeling and design of computer systems : queueing theory in action
Title
Performance modeling and design of computer systems
Title remainder
queueing theory in action
Statement of responsibility
Mor Harchol-Balter
Creator
Contributor
Subject
Genre
Language
eng
Cataloging source
NhCcYBP
Dewey number
519.8/2
Index
index present
LC call number
QA76.545
LC item number
.H37 2013
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Label
Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter
Link
http://site.ebrary.com/lib/byuprovo/docDetail.action?docID=10659343
Instantiates
Publication
Note
Description based on print version record
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier MARC source
rdacarrier
Content category
text
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource.
Form of item
online
Isbn
9781139612692
Isbn Type
(electronic bk.)
Media category
computer
Media MARC source
rdamedia
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
UtOrBLW
Label
Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter
Link
http://site.ebrary.com/lib/byuprovo/docDetail.action?docID=10659343
Publication
Note
Description based on print version record
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier MARC source
rdacarrier
Content category
text
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource.
Form of item
online
Isbn
9781139612692
Isbn Type
(electronic bk.)
Media category
computer
Media MARC source
rdamedia
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
UtOrBLW

Library Locations

Processing Feedback ...