Performance Modeling and Design of Computer Systems: Queueing Theory in ActionCambridge University Press, 18 ก.พ. 2013 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. |
เนื้อหา
Queueing Theory Terminology | 13 |
Necessary Probability Background | 29 |
Generating Random Variables for Simulation | 70 |
Sample Paths Convergence and Averages | 79 |
WhatIf | 93 |
WhatIf for Closed Systems | 114 |
From Markov Chains to Simple Queues | 127 |
Ergodicity Theory | 148 |
High Variability and Heavy Tails | 347 |
PhaseType Distributions and MatrixAnalytic Methods | 359 |
Networks With TimeSharing PS Servers BCMP | 380 |
The MIG1 Queue and the Inspection Paradox | 395 |
Task Assignment Policies for Server Farms | 408 |
Transform Analysis | 433 |
MIG1 Transform Analysis | 450 |
Power Optimization Application | 457 |
Google Aloha and Harder Chains | 190 |
Exponential Distribution and the Poisson Process | 206 |
Transition to ContinuousTime Markov Chains | 225 |
Multiserver Multiqueue Systems | 251 |
Capacity Provisioning for Server Farms | 269 |
TimeReversibility and Burkes Theorem | 282 |
Networks of Queues and Jackson Product Form | 297 |
Classed Network of Queues | 311 |
Closed Networks of Queues | 331 |
ฉบับอื่นๆ - ดูทั้งหมด
Performance Modeling and Design of Computer Systems: Queueing Theory in Action Mor Harchol-Balter ชมบางส่วนของหนังสือ - 2013 |
คำและวลีที่พบบ่อย
analysis Answer arrival process arrival rate assume balance equations busy period chapter classed networks closed system computer systems Consider CTMC defined Definition derive disk DTMC ergodic example Exercise Exp(A expected number Exponentially distributed FCFS servers file find finite first flips fraction given host independent interarrival intuition irreducible Jackson network job in service job size distribution job size variability job’s jobs arrive jobs at server Laplace transform limiting distribution limiting probabilities Little’s Law load Markov chain mean number mean response mean slowdown non-preemptive number of jobs number of servers Observe packets Pareto distribution Poisson process priority priority queueing problem process with rate proof Question queueing theory random variables rate of transitions sample paths scheduling policy server farm service rate setup shown in Figure SITA solve Specifically SRPT stationary distribution stationary equations Suppose task assignment policies Theorem throughput time-reversibility z-transform