LEADER 04871nam 22006612 450 001 9910465041203321 005 20151019153022.0 010 $a1-107-23684-3 010 $a1-107-25475-2 010 $a1-139-61641-2 010 $a1-139-62571-3 010 $a1-139-61269-7 010 $a1-139-22642-8 035 $a(CKB)3460000000129185 035 $a(EBL)1099911 035 $a(OCoLC)828302647 035 $a(SSID)ssj0000821329 035 $a(PQKBManifestationID)11444804 035 $a(PQKBTitleCode)TC0000821329 035 $a(PQKBWorkID)10870655 035 $a(PQKB)11637685 035 $a(UkCbUP)CR9781139226424 035 $a(MiAaPQ)EBC1099911 035 $a(Au-PeEL)EBL1099911 035 $a(CaPaEBR)ebr10659343 035 $a(EXLCZ)993460000000129185 100 $a20120104d2013|||| uy| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aPerformance modeling and design of computer systems $equeueing theory in action /$fMor Harchol-Balter, Carnegie Mellon University, Pennsylvania$b[electronic resource] 210 1$aCambridge :$cCambridge University Press,$d2013. 215 $a1 online resource (xxiii, 548 pages) $cdigital, PDF file(s) 300 $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). 311 $a1-107-02750-0 311 $a1-139-61083-X 320 $aIncludes bibliographical references and index. 327 $aMachine 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. 330 $aTackling 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. 517 3 $aPerformance modeling & design of computer systems 606 $aTransaction systems (Computer systems)$xMathematical models 606 $aComputer systems$xDesign and construction$xMathematics 606 $aQueuing theory 606 $aQueuing networks (Data transmission) 615 0$aTransaction systems (Computer systems)$xMathematical models. 615 0$aComputer systems$xDesign and construction$xMathematics. 615 0$aQueuing theory. 615 0$aQueuing networks (Data transmission) 676 $a519.8/2 700 $aHarchol-Balter$b Mor$f1966-$0925107 801 0$bUkCbUP 801 1$bUkCbUP 906 $aBOOK 912 $a9910465041203321 996 $aPerformance modeling and design of computer systems$92453545 997 $aUNINA LEADER 01263nam0 22002891i 450 001 UON00045248 005 20231205102203.374 100 $a20020107d1970 |0itac50 ba 101 $ager 102 $aDE 105 $a|||| 1|||| 200 1 $aStrukturen und figuren im kult von Jerusalem$eStudien zur altorientalischen vor- und fruhisrealitischen religion$fFritz Stolz 210 $aBerlin$cTopelmann$d1970 215 $a235 p.$d24 cm 410 1$1001UON00037182$12001 $aBeihefte zur Zeitschrift fur die Alttestamentliche Wissenschaft$v118 606 $aANTICO TESTAMENTO$xSTUDI CRITICI$3UONC002330$2FI 606 $aISRAELE$xStoria$xPeriodo biblico$3UONC005950$2FI 620 $aDE$dBerlin$3UONL003157 686 $aSEB VII A$cSTUDI EBRAICI - FILOSOFIA E RELIGIONE - STUDI BIBLICI$2A 700 1$aSTOLZ$bFritz$3UONV026621$0648216 712 $aDe Gruyter$3UONV248587$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00045248 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI SEB VII A 007 $eSI SEM1736 5 007 996 $aStrukturen und figuren im kult von Jerusalem$91158489 997 $aUNIOR