Performance modeling and design of computer systems :: queueing theory in action /
"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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge :
Cambridge University Press,
2013.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "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"-- |
| Beschreibung: | 1 online resource (xxiii, 548 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 531-539) and index. |
| ISBN: | 9781139616416 1139616412 9781139610834 113961083X 9781139625715 1139625713 9781139226424 1139226428 9781139612692 1139612697 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn828302647 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 130223s2013 enka ob 001 0 eng d | ||
| 010 | |a 2012019844 | ||
| 040 | |a EBLCP |b eng |e rda |e pn |c EBLCP |d OCLCQ |d N$T |d YDXCP |d CAMBR |d OCLCO |d DEBSZ |d UMI |d OSU |d E7B |d OCLCQ |d EUX |d AU@ |d HEBIS |d OCLCQ |d MYUKM |d OCLCQ |d OCLCO |d COO |d OCLCA |d OCLCF |d CEF |d WYU |d TKN |d UPM |d UKAHL |d OL$ |d OCLCQ |d A6Q |d LOA |d K6U |d VT2 |d OCLCQ |d OCLCA |d LUN |d OCLCQ |d OCLCO |d AUW |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ |d OCLCL |d SFB | ||
| 019 | |a 828424176 |a 844328513 |a 858995459 |a 874422835 |a 880909797 |a 990462641 |a 1066460443 |a 1107752857 |a 1109945960 |a 1111265831 |a 1117836892 |a 1167288526 |a 1228606934 | ||
| 020 | |a 9781139616416 |q (electronic bk.) | ||
| 020 | |a 1139616412 |q (electronic bk.) | ||
| 020 | |a 9781139610834 |q (electronic bk.) | ||
| 020 | |a 113961083X |q (electronic bk.) | ||
| 020 | |a 9781139625715 |q (electronic bk.) | ||
| 020 | |a 1139625713 |q (electronic bk.) | ||
| 020 | |a 9781139226424 |q (electronic bk.) | ||
| 020 | |a 1139226428 |q (electronic bk.) | ||
| 020 | |a 9781139612692 |q (electronic bk.) | ||
| 020 | |a 1139612697 |q (electronic bk.) | ||
| 020 | |z 9781107027503 |q (hardback) | ||
| 020 | |z 1107027500 |q (hardback) | ||
| 035 | |a (OCoLC)828302647 |z (OCoLC)828424176 |z (OCoLC)844328513 |z (OCoLC)858995459 |z (OCoLC)874422835 |z (OCoLC)880909797 |z (OCoLC)990462641 |z (OCoLC)1066460443 |z (OCoLC)1107752857 |z (OCoLC)1109945960 |z (OCoLC)1111265831 |z (OCoLC)1117836892 |z (OCoLC)1167288526 |z (OCoLC)1228606934 | ||
| 037 | |a CL0500000298 |b Safari Books Online | ||
| 050 | 4 | |a QA76.545 |b .H37 2013 | |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 029000 |2 bisacsh | |
| 082 | 7 | |a 004.21 |a 519.8/2 |a 519.82 | |
| 084 | |a COM000000 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Harchol-Balter, Mor, |d 1966- |e author. |1 https://id.oclc.org/worldcat/entity/E39PCjD3xRtrG4dFRJW9hCBqpK |0 http://id.loc.gov/authorities/names/n2012034287 | |
| 245 | 1 | 0 | |a Performance modeling and design of computer systems : |b queueing theory in action / |c Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania. |
| 264 | 1 | |a Cambridge : |b Cambridge University Press, |c 2013. | |
| 300 | |a 1 online resource (xxiii, 548 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file | ||
| 520 | |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"-- |c Provided by publisher | ||
| 504 | |a Includes bibliographical references (pages 531-539) and index. | ||
| 505 | 0 | |a 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. | |
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Transaction systems (Computer systems) |x Mathematical models. | |
| 650 | 0 | |a Computer systems |x Design and construction |x Mathematics. | |
| 650 | 0 | |a Queuing theory. |0 http://id.loc.gov/authorities/subjects/sh85109832 | |
| 650 | 0 | |a Queuing networks (Data transmission) |0 http://id.loc.gov/authorities/subjects/sh2007002386 | |
| 650 | 6 | |a Systèmes transactionnels |x Modèles mathématiques. | |
| 650 | 6 | |a Théorie des files d'attente. | |
| 650 | 6 | |a Réseaux de files d'attente (Transmission des données) | |
| 650 | 7 | |a COMPUTERS |x General. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
| 650 | 7 | |a Queuing networks (Data transmission) |2 fast | |
| 650 | 7 | |a Queuing theory |2 fast | |
| 650 | 7 | |a Design |2 gnd | |
| 650 | 7 | |a Computer |2 gnd | |
| 650 | 7 | |a Warteschlangentheorie |2 gnd |0 http://d-nb.info/gnd/4255044-0 | |
| 655 | 0 | |a Electronic book. | |
| 655 | 4 | |a Electronic books. | |
| 758 | |i has work: |a Performance modeling and design of computer systems (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGQtMWkc7DPp8HVF7vDqjP |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Harchol-Balter, Mor, 1966- |t Performance modeling and design of computer systems. |d Cambridge : Cambridge University Press, 2013 |z 9781107027503 |w (DLC) 2012019844 |w (OCoLC)795763742 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=508924 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34206328 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH33351045 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1099911 | ||
| 938 | |a ebrary |b EBRY |n ebr10659343 | ||
| 938 | |a EBSCOhost |b EBSC |n 508924 | ||
| 938 | |a YBP Library Services |b YANK |n 10198004 | ||
| 938 | |a YBP Library Services |b YANK |n 10143781 | ||
| 938 | |a YBP Library Services |b YANK |n 10249868 | ||
| 938 | |a YBP Library Services |b YANK |n 10197114 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn828302647 |
|---|---|
| _version_ | 1816882222842511360 |
| adam_text | |
| any_adam_object | |
| author | Harchol-Balter, Mor, 1966- |
| author_GND | http://id.loc.gov/authorities/names/n2012034287 |
| author_facet | Harchol-Balter, Mor, 1966- |
| author_role | aut |
| author_sort | Harchol-Balter, Mor, 1966- |
| author_variant | m h b mhb |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.545 .H37 2013 |
| callnumber-search | QA76.545 .H37 2013 |
| callnumber-sort | QA 276.545 H37 42013 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| 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. |
| ctrlnum | (OCoLC)828302647 |
| dewey-full | 004.21 519.8/2 519.82 |
| dewey-hundreds | 000 - Computer science, information, general works 500 - Natural sciences and mathematics |
| dewey-ones | 004 - Computer science 519 - Probabilities and applied mathematics |
| dewey-raw | 004.21 519.8/2 519.82 |
| dewey-search | 004.21 519.8/2 519.82 |
| dewey-sort | 14.21 |
| dewey-tens | 000 - Computer science, information, general works 510 - Mathematics |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07295cam a2200877 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn828302647</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mn|||||||||</controlfield><controlfield tag="008">130223s2013 enka ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a"> 2012019844</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">UMI</subfield><subfield code="d">OSU</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EUX</subfield><subfield code="d">AU@</subfield><subfield code="d">HEBIS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MYUKM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCF</subfield><subfield code="d">CEF</subfield><subfield code="d">WYU</subfield><subfield code="d">TKN</subfield><subfield code="d">UPM</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">A6Q</subfield><subfield code="d">LOA</subfield><subfield code="d">K6U</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">LUN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">AUW</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">828424176</subfield><subfield code="a">844328513</subfield><subfield code="a">858995459</subfield><subfield code="a">874422835</subfield><subfield code="a">880909797</subfield><subfield code="a">990462641</subfield><subfield code="a">1066460443</subfield><subfield code="a">1107752857</subfield><subfield code="a">1109945960</subfield><subfield code="a">1111265831</subfield><subfield code="a">1117836892</subfield><subfield code="a">1167288526</subfield><subfield code="a">1228606934</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139616416</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139616412</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139610834</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">113961083X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139625715</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139625713</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139226424</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139226428</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139612692</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139612697</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107027503</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1107027500</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)828302647</subfield><subfield code="z">(OCoLC)828424176</subfield><subfield code="z">(OCoLC)844328513</subfield><subfield code="z">(OCoLC)858995459</subfield><subfield code="z">(OCoLC)874422835</subfield><subfield code="z">(OCoLC)880909797</subfield><subfield code="z">(OCoLC)990462641</subfield><subfield code="z">(OCoLC)1066460443</subfield><subfield code="z">(OCoLC)1107752857</subfield><subfield code="z">(OCoLC)1109945960</subfield><subfield code="z">(OCoLC)1111265831</subfield><subfield code="z">(OCoLC)1117836892</subfield><subfield code="z">(OCoLC)1167288526</subfield><subfield code="z">(OCoLC)1228606934</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">CL0500000298</subfield><subfield code="b">Safari Books Online</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.545</subfield><subfield code="b">.H37 2013</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">029000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.21</subfield><subfield code="a">519.8/2</subfield><subfield code="a">519.82</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">COM000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harchol-Balter, Mor,</subfield><subfield code="d">1966-</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjD3xRtrG4dFRJW9hCBqpK</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2012034287</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance modeling and design of computer systems :</subfield><subfield code="b">queueing theory in action /</subfield><subfield code="c">Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><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">1 online resource (xxiii, 548 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</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="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 531-539) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</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><subfield code="0">http://id.loc.gov/authorities/subjects/sh85109832</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Queuing networks (Data transmission)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2007002386</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Systèmes transactionnels</subfield><subfield code="x">Modèles mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des files d'attente.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Réseaux de files d'attente (Transmission des données)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Probability & Statistics</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Queuing networks (Data transmission)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Queuing theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Design</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4255044-0</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic book.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Performance modeling and design of computer systems (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGQtMWkc7DPp8HVF7vDqjP</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Harchol-Balter, Mor, 1966-</subfield><subfield code="t">Performance modeling and design of computer systems.</subfield><subfield code="d">Cambridge : Cambridge University Press, 2013</subfield><subfield code="z">9781107027503</subfield><subfield code="w">(DLC) 2012019844</subfield><subfield code="w">(OCoLC)795763742</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=508924</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH34206328</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH33351045</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1099911</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10659343</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">508924</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10198004</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10143781</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10249868</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10197114</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic book. Electronic books. |
| genre_facet | Electronic book. Electronic books. |
| id | ZDB-4-EBA-ocn828302647 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:11Z |
| institution | BVB |
| isbn | 9781139616416 1139616412 9781139610834 113961083X 9781139625715 1139625713 9781139226424 1139226428 9781139612692 1139612697 |
| language | English |
| lccn | 2012019844 |
| oclc_num | 828302647 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xxiii, 548 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Harchol-Balter, Mor, 1966- author. https://id.oclc.org/worldcat/entity/E39PCjD3xRtrG4dFRJW9hCBqpK http://id.loc.gov/authorities/names/n2012034287 Performance modeling and design of computer systems : queueing theory in action / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania. Cambridge : Cambridge University Press, 2013. 1 online resource (xxiii, 548 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file "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 Includes bibliographical references (pages 531-539) and index. 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. Print version record. Transaction systems (Computer systems) Mathematical models. Computer systems Design and construction Mathematics. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Queuing networks (Data transmission) http://id.loc.gov/authorities/subjects/sh2007002386 Systèmes transactionnels Modèles mathématiques. Théorie des files d'attente. Réseaux de files d'attente (Transmission des données) COMPUTERS General. bisacsh MATHEMATICS Applied. bisacsh MATHEMATICS Probability & Statistics General. bisacsh Queuing networks (Data transmission) fast Queuing theory fast Design gnd Computer gnd Warteschlangentheorie gnd http://d-nb.info/gnd/4255044-0 Electronic book. Electronic books. has work: Performance modeling and design of computer systems (Text) https://id.oclc.org/worldcat/entity/E39PCGQtMWkc7DPp8HVF7vDqjP https://id.oclc.org/worldcat/ontology/hasWork Print version: Harchol-Balter, Mor, 1966- Performance modeling and design of computer systems. Cambridge : Cambridge University Press, 2013 9781107027503 (DLC) 2012019844 (OCoLC)795763742 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=508924 Volltext |
| spellingShingle | Harchol-Balter, Mor, 1966- Performance modeling and design of computer systems : queueing theory in action / 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. Transaction systems (Computer systems) Mathematical models. Computer systems Design and construction Mathematics. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Queuing networks (Data transmission) http://id.loc.gov/authorities/subjects/sh2007002386 Systèmes transactionnels Modèles mathématiques. Théorie des files d'attente. Réseaux de files d'attente (Transmission des données) COMPUTERS General. bisacsh MATHEMATICS Applied. bisacsh MATHEMATICS Probability & Statistics General. bisacsh Queuing networks (Data transmission) fast Queuing theory fast Design gnd Computer gnd Warteschlangentheorie gnd http://d-nb.info/gnd/4255044-0 |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85109832 http://id.loc.gov/authorities/subjects/sh2007002386 http://d-nb.info/gnd/4255044-0 |
| title | Performance modeling and design of computer systems : queueing theory in action / |
| title_auth | Performance modeling and design of computer systems : queueing theory in action / |
| title_exact_search | Performance modeling and design of computer systems : queueing theory in action / |
| title_full | Performance modeling and design of computer systems : queueing theory in action / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania. |
| title_fullStr | Performance modeling and design of computer systems : queueing theory in action / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania. |
| title_full_unstemmed | Performance modeling and design of computer systems : queueing theory in action / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania. |
| title_short | Performance modeling and design of computer systems : |
| title_sort | performance modeling and design of computer systems queueing theory in action |
| title_sub | queueing theory in action / |
| topic | Transaction systems (Computer systems) Mathematical models. Computer systems Design and construction Mathematics. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Queuing networks (Data transmission) http://id.loc.gov/authorities/subjects/sh2007002386 Systèmes transactionnels Modèles mathématiques. Théorie des files d'attente. Réseaux de files d'attente (Transmission des données) COMPUTERS General. bisacsh MATHEMATICS Applied. bisacsh MATHEMATICS Probability & Statistics General. bisacsh Queuing networks (Data transmission) fast Queuing theory fast Design gnd Computer gnd Warteschlangentheorie gnd http://d-nb.info/gnd/4255044-0 |
| topic_facet | Transaction systems (Computer systems) Mathematical models. Computer systems Design and construction Mathematics. Queuing theory. Queuing networks (Data transmission) Systèmes transactionnels Modèles mathématiques. Théorie des files d'attente. Réseaux de files d'attente (Transmission des données) COMPUTERS General. MATHEMATICS Applied. MATHEMATICS Probability & Statistics General. Queuing theory Design Computer Warteschlangentheorie Electronic book. Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=508924 |
| work_keys_str_mv | AT harcholbaltermor performancemodelinganddesignofcomputersystemsqueueingtheoryinaction |