The Resource Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania
Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania
Resource Information
The item Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.
This item is available to borrow from 1 library branch.
 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 largescale systems with good performance and low cost. The exercises are an important feature, teaching researchlevel 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"
 Language
 eng
 Extent
 1 online resource (xxiii, 548 pages)
 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: 'WhatIf' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "whatif" for closed systems
 Part IV. From Markov Chains to Simple Queues: 8. Discretetime Markov Chains; 9. Ergodicity theory; 10. Realworld examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuoustime Markov Chains; 13. M/M/I and PASTA
 V. Server Farms and Networks: Multiserver, Multiqueue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Timereversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues
 VI. RealWorld Workloads: HighVariability and Heavy Tails: 20. Tales of tails: realworld workloads; 21. Phasetype workloads and matrixanalytic methods; 22. Networks with timesharing (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: nonpreemptive, nonsizebased policies; 30. Scheduling: preemptive, nonsizebased policies; 31. Scheduling: nonpreemptive, sizebased policies; 32. Scheduling: preemptive, sizebased policies; 33. Scheduling: SRPT and fairness
 Isbn
 9781139612692
 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 HarcholBalter, Carnegie Mellon University, Pennsylvania
 Subject

 Computer
 Computer systems  Design and construction  Mathematics
 Design
 Electronic book
 MATHEMATICS  Applied
 MATHEMATICS  Probability & Statistics  General
 Queuing networks (Data transmission)
 Queuing theory
 Queuing theory
 Transaction systems (Computer systems)  Mathematical models
 Warteschlangentheorie
 Queuing networks (Data transmission)
 COMPUTERS  General
 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 largescale systems with good performance and low cost. The exercises are an important feature, teaching researchlevel 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"
 Assigning source
 Provided by publisher
 Cataloging source
 EBLCP
 http://library.link/vocab/creatorDate
 1966
 http://library.link/vocab/creatorName
 HarcholBalter, 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 HarcholBalter, Carnegie Mellon University, Pennsylvania
 Bibliography note
 Includes bibliographical references (pages 531539) 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: 'WhatIf' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "whatif" for closed systems  Part IV. From Markov Chains to Simple Queues: 8. Discretetime Markov Chains; 9. Ergodicity theory; 10. Realworld examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuoustime Markov Chains; 13. M/M/I and PASTA  V. Server Farms and Networks: Multiserver, Multiqueue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Timereversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues  VI. RealWorld Workloads: HighVariability and Heavy Tails: 20. Tales of tails: realworld workloads; 21. Phasetype workloads and matrixanalytic methods; 22. Networks with timesharing (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: nonpreemptive, nonsizebased policies; 30. Scheduling: preemptive, nonsizebased policies; 31. Scheduling: nonpreemptive, sizebased policies; 32. Scheduling: preemptive, sizebased 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 HarcholBalter, Carnegie Mellon University, Pennsylvania
 Bibliography note
 Includes bibliographical references (pages 531539) 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: 'WhatIf' Questions and Answers; 6. Little's law and other operational laws; 7. Modification analysis: "whatif" for closed systems  Part IV. From Markov Chains to Simple Queues: 8. Discretetime Markov Chains; 9. Ergodicity theory; 10. Realworld examples: Google, Aloha, and harder chains; 11. Exponential distribution and the Poisson process; 12. Transition to continuoustime Markov Chains; 13. M/M/I and PASTA  V. Server Farms and Networks: Multiserver, Multiqueue Systems: 14. Server farms: M/M/k and M/M/k/k; 15. Capacity provisioning for server farms; 16. Timereversibility and Burke's Theorem; 17. Networks of queues and Jackson product form; 18. Classed network of queues; 19. Closed networks of queues  VI. RealWorld Workloads: HighVariability and Heavy Tails: 20. Tales of tails: realworld workloads; 21. Phasetype workloads and matrixanalytic methods; 22. Networks with timesharing (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: nonpreemptive, nonsizebased policies; 30. Scheduling: preemptive, nonsizebased policies; 31. Scheduling: nonpreemptive, sizebased policies; 32. Scheduling: preemptive, sizebased 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
Subject
 Computer
 Computer systems  Design and construction  Mathematics
 Design
 Electronic book
 MATHEMATICS  Applied
 MATHEMATICS  Probability & Statistics  General
 Queuing networks (Data transmission)
 Queuing theory
 Queuing theory
 Transaction systems (Computer systems)  Mathematical models
 Warteschlangentheorie
 Queuing networks (Data transmission)
 COMPUTERS  General
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Performancemodelinganddesignofcomputer/fORDSeEaAkc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Performancemodelinganddesignofcomputer/fORDSeEaAkc/">Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Performancemodelinganddesignofcomputer/fORDSeEaAkc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Performancemodelinganddesignofcomputer/fORDSeEaAkc/">Performance modeling and design of computer systems : queueing theory in action, Mor HarcholBalter, Carnegie Mellon University, Pennsylvania</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>