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

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

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, Carnegie Mellon University, Pennsylvania
Creator
Author
Subject
Genre
Language
eng
Summary
"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"--
Member of
Assigning source
Provided by publisher
Cataloging source
EBLCP
http://library.link/vocab/creatorDate
1966-
http://library.link/vocab/creatorName
Harchol-Balter, Mor
Dewey number
  • 004.21
  • 519.8/2
  • 519.82
Illustrations
illustrations
Index
index present
LC call number
QA76.545
LC item number
.H37 2013
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/subjectName
  • Transaction systems (Computer systems)
  • Computer systems
  • Queuing theory
  • Queuing networks (Data transmission)
  • COMPUTERS
  • MATHEMATICS
  • MATHEMATICS
  • Queuing networks (Data transmission)
  • Queuing theory
  • Design
  • Computer
  • Warteschlangentheorie
Label
Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages 531-539) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
mixed
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology -- II. Necessary Probability Background: 3. Probability review; 4. Generating random variables for simulation; 5. Sample paths, convergence, and averages -- Part III. The Predictive Power of Simple Operational Laws: 'What-If' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "what-if" for closed systems -- Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuous-time Markov Chains; 13. M/M/I and PASTA -- V. Server Farms and Networks: Multi-server, Multi-queue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Time-reversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues -- VI. Real-World Workloads: High-Variability and Heavy Tails: 20. Tales of tails: real-world workloads; 21. Phase-type workloads and matrix-analytic methods; 22. Networks with time-sharing (PS) servers (BCMP); 23. The M/G/I queue and inspection paradox; 24. Task assignment for server farms; 25. Transform analysis; 26. M/G/I transform analysis; 27. Power optimization application -- VII. Smart Scheduling in the M/G/I: 28. Performance metrics; 29. Scheduling: non-preemptive, non-size-based policies; 30. Scheduling: preemptive, non-size-based policies; 31. Scheduling: non-preemptive, size-based policies; 32. Scheduling: preemptive, size-based policies; 33. Scheduling: SRPT and fairness
Control code
828302647
Dimensions
unknown
Extent
1 online resource (xxiii, 548 pages)
Form of item
online
Isbn
9781139612692
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
cl0500000298
Specific material designation
remote
System control number
(OCoLC)828302647
Label
Performance modeling and design of computer systems : queueing theory in action, Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania
Publication
Bibliography note
Includes bibliographical references (pages 531-539) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
mixed
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology -- II. Necessary Probability Background: 3. Probability review; 4. Generating random variables for simulation; 5. Sample paths, convergence, and averages -- Part III. The Predictive Power of Simple Operational Laws: 'What-If' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "what-if" for closed systems -- Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuous-time Markov Chains; 13. M/M/I and PASTA -- V. Server Farms and Networks: Multi-server, Multi-queue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Time-reversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues -- VI. Real-World Workloads: High-Variability and Heavy Tails: 20. Tales of tails: real-world workloads; 21. Phase-type workloads and matrix-analytic methods; 22. Networks with time-sharing (PS) servers (BCMP); 23. The M/G/I queue and inspection paradox; 24. Task assignment for server farms; 25. Transform analysis; 26. M/G/I transform analysis; 27. Power optimization application -- VII. Smart Scheduling in the M/G/I: 28. Performance metrics; 29. Scheduling: non-preemptive, non-size-based policies; 30. Scheduling: preemptive, non-size-based policies; 31. Scheduling: non-preemptive, size-based policies; 32. Scheduling: preemptive, size-based policies; 33. Scheduling: SRPT and fairness
Control code
828302647
Dimensions
unknown
Extent
1 online resource (xxiii, 548 pages)
Form of item
online
Isbn
9781139612692
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
cl0500000298
Specific material designation
remote
System control number
(OCoLC)828302647

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107
Processing Feedback ...