ISBN 9781107439917,Performance Modeling and Design of Computer System

Performance Modeling and Design of Computer System

Rs1166 Rs1295 10% OFF

Availability: Out of Stock

(Free Delivery)

We Accept
ISBN 9781107439917
Check delivery information
 
ISBN 9781107439917
Publisher

Cambridge University Press

Publication Year 2014
ISBN-13

ISBN 9781107439917

ISBN-10 1107439914
Binding

Paper Back

Number of Pages 569 Pages
Language (English)
Subject

Computer science

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.

Table of Contents:
Contents 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.
Scroll