Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter.
"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 we...
Saved in:
: | |
---|---|
TeilnehmendeR: | |
Year of Publication: | 2013 |
Language: | English |
Online Access: | |
Physical Description: | xxiii, 548 p. :; ill. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
5001099911 |
---|---|
ctrlnum |
(MiAaPQ)5001099911 (Au-PeEL)EBL1099911 (CaPaEBR)ebr10659343 (OCoLC)828302647 |
collection |
bib_alma |
record_format |
marc |
spelling |
Harchol-Balter, Mor, 1966- Performance modeling and design of computer systems [electronic resource] : queueing theory in action / Mor Harchol-Balter. Cambridge : Cambridge University Press, 2013. xxiii, 548 p. : ill. Includes bibliographical references and index. 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. "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"-- Provided by publisher. Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Transaction systems (Computer systems) Mathematical models. Computer systems Design and construction Mathematics. Queuing theory. Queuing networks (Data transmission) Electronic books. ProQuest (Firm) https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1099911 Click to View |
language |
English |
format |
Electronic eBook |
author |
Harchol-Balter, Mor, 1966- |
spellingShingle |
Harchol-Balter, Mor, 1966- Performance modeling and design of computer systems queueing theory in action / 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. |
author_facet |
Harchol-Balter, Mor, 1966- ProQuest (Firm) ProQuest (Firm) |
author_variant |
m h b mhb |
author2 |
ProQuest (Firm) |
author2_role |
TeilnehmendeR |
author_corporate |
ProQuest (Firm) |
author_sort |
Harchol-Balter, Mor, 1966- |
title |
Performance modeling and design of computer systems queueing theory in action / |
title_sub |
queueing theory in action / |
title_full |
Performance modeling and design of computer systems [electronic resource] : queueing theory in action / Mor Harchol-Balter. |
title_fullStr |
Performance modeling and design of computer systems [electronic resource] : queueing theory in action / Mor Harchol-Balter. |
title_full_unstemmed |
Performance modeling and design of computer systems [electronic resource] : queueing theory in action / Mor Harchol-Balter. |
title_auth |
Performance modeling and design of computer systems queueing theory in action / |
title_new |
Performance modeling and design of computer systems |
title_sort |
performance modeling and design of computer systems queueing theory in action / |
publisher |
Cambridge University Press, |
publishDate |
2013 |
physical |
xxiii, 548 p. : ill. |
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. |
isbn |
9781139612692 (electronic bk.) |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA76 |
callnumber-sort |
QA 276.545 H37 42013 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1099911 |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
519 - Probabilities & applied mathematics |
dewey-full |
519.8/2 |
dewey-sort |
3519.8 12 |
dewey-raw |
519.8/2 |
dewey-search |
519.8/2 |
oclc_num |
828302647 |
work_keys_str_mv |
AT harcholbaltermor performancemodelinganddesignofcomputersystemsqueueingtheoryinaction AT proquestfirm performancemodelinganddesignofcomputersystemsqueueingtheoryinaction |
status_str |
n |
ids_txt_mv |
(MiAaPQ)5001099911 (Au-PeEL)EBL1099911 (CaPaEBR)ebr10659343 (OCoLC)828302647 |
is_hierarchy_title |
Performance modeling and design of computer systems queueing theory in action / |
author2_original_writing_str_mv |
noLinkedField |
_version_ |
1792330741765373952 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04138nam a2200397 a 4500</leader><controlfield tag="001">5001099911</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">120521s2013 enka sb 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2012019844</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107027503</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139612692 (electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5001099911</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL1099911</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10659343</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)828302647</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.545</subfield><subfield code="b">.H37 2013</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.8/2</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harchol-Balter, Mor,</subfield><subfield code="d">1966-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance modeling and design of computer systems</subfield><subfield code="h">[electronic resource] :</subfield><subfield code="b">queueing theory in action /</subfield><subfield code="c">Mor Harchol-Balter.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2013.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxiii, 548 p. :</subfield><subfield code="b">ill.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Transaction systems (Computer systems)</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer systems</subfield><subfield code="x">Design and construction</subfield><subfield code="x">Mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Queuing theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Queuing networks (Data transmission)</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1099911</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |