Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910465041203321 |
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Classificazione | COM000000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910789462403321 |
|
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Classificazione | COM000000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910821695403321 |
|
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||