LEADER 01231nam--2200421---450- 001 990002944770203316 005 20070614154232.0 010 $a978-88-420-8236-1 035 $a000294477 035 $aUSA01000294477 035 $a(ALEPH)000294477USA01 035 $a000294477 100 $a20070614d2007----km-y0itay50------ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aFilosofia delle donne$fPieranna Garavaso, Nicla Vassallo 210 $aRoma [etc.]$cGLF editori Laterza$d2007 215 $a165 p.$d18 cm. 225 2 $aBiblioteca essenziale Laterza$v74 410 0$12001$aBiblioteca essenziale Laterza$v74 454 1$12001 461 1$1001-------$12001 606 0 $aFemminismo 606 0 $aDonna$xConcezione 606 0 $aDonna$xConcezione filosofica 676 $a305.4 700 1$aGARAVASO,$bPieranna$0597396 701 1$aVASSALLO,$bNicla$09621 801 0$aIT$bsalbc$gISBD 912 $a990002944770203316 951 $aII.1.D. 1800$b197386 L.M.$cII.1.D.$d00160288 959 $aBK 969 $aUMA 979 $aRIVELLI$b90$c20070614$lUSA01$h1540 979 $aRIVELLI$b90$c20070614$lUSA01$h1542 996 $aFilosofia delle donne$91030580 997 $aUNISA LEADER 01640cam2-2200433---450 001 990001268370203316 005 20190904133757.0 035 $a000126837 035 $aUSA01000126837 035 $a(ALEPH)000126837USA01 035 $a000126837 100 $a20031120g19211922km-y0itay5003----ba 101 0 $ager 102 $aDE 105 $ay|||f|||001yy 200 1 $a<<11. Band:>> Katoikoi bis Kynegoi 210 $aStuttgart$cDruckenmüller$d1921-1922 215 $a2 tomi (2560 colonne)$d24 cm 300 $aSui dorsi: Band XI, 1 e Band XI, 2 300 $aEditore nel tomo 2: Metzlersche Verlagsbuchhandlung 327 1 $a21. Halbband: Katoikoi bis Komödie$a22. Halbband: Komogrammateus bis Kynegoi : mit Register der ausserhalb der alphabetischen Reihenfolge stehenden Artikel 461 0$1001000126657$12001$aPaulys Real-Encyclopädie der classischen Altertumswissenschaft 540 1 $a<<21. Halbband:>> Katoikoi bis Komödie 540 1 $a<<22. Halbband: Komogrammateus bis Kynegoi 702 1$aWISSOWA,$bGeorg 702 1$aKROLL,$bWilhelm 801 0$aIT$bsalbc$gISBD 912 $a990001268370203316 951 $aI.1.B. 938 3 1 11.21(938 3 1 11.21, 938 PAU)$b653 L.M.$cI.1.$d448316 951 $aI.1.B. 938 3 1 11.22(938 3 1 11.22, 938 PAU)$b654 L.M.$cI.1.$d448317 959 $aBK 969 $aUMA 979 $aSIAV1$b10$c20031120$lUSA01$h1223 979 $aSIAV1$b10$c20031120$lUSA01$h1223 979 $aPATRY$b90$c20040406$lUSA01$h1730 979 $aCOPAT6$b90$c20051111$lUSA01$h1538 979 $aCOPAT6$b90$c20070102$lUSA01$h1428 996 $aKatoikoi bis Kynegoi$91561152 997 $aUNISA LEADER 04937nam 22006852 450 001 9910789462403321 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(PPN)261297112 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 686 $aCOM000000$2bisacsh 700 $aHarchol-Balter$b Mor$f1966-$0925107 801 0$bUkCbUP 801 1$bUkCbUP 906 $aBOOK 912 $a9910789462403321 996 $aPerformance modeling and design of computer systems$92696024 997 $aUNINA