http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Analytical performance modeling for computer systems
1 online resource (xvii, 153 pages) : illustrations.
This book is an introduction to analytical performance modeling for computer systems, i.e., writing equations to describe their performance behavior. It is accessible to readers who have taken college-level courses in calculus and probability, networking, and operating systems. This is not a training manual for becoming an expert performance analyst. Rather, the objective is to help the reader construct simple models for analyzing and understanding the systems that they are interested in. Describing a complicated system abstractly with mathematical equations requires a careful choice of assumptions and approximations. They make the model tractable, but they must not remove essential characteristics of the system, nor introduce spurious properties. To help the reader understand the choices and their implications, this book discusses the analytical models for 40 research papers. These papers cover a broad range of topics: GPUs and disks, routers and crawling, databases and multimedia, worms and wireless, multicore and cloud, security and energy, etc. An appendix provides many questions for readers to exercise their understanding of the models in these papers.
1. Concepts and Little's Law -- 1.1 Concepts -- 1.2 Open and closed systems -- 1.3 Little's Law -- 1.4 Discussion of papers --
10. Analysis with an analytical model -- 10.1 The science and art in performance modeling -- 10.1.1 Power -- 10.1.2 Technique -- 10.1.3 Assumptions and approximations -- 1.4 Metrics -- 10.1.5 Science and technology -- 10.1.6 Intuition and contradiction -- 10.2 Discussion of papers --
11. Exercises -- Bibliography -- Author's biography -- Index.
2. Single queues -- 2.1 Applying Little's Law to a 1-server queue -- 2.2 Queue specification -- 2.3 Pollaczek-Khinchin formula -- 2.4 Discussion of papers --
3. Open systems -- 3.1 Residual life -- 3.2 Birth-death process -- 3.3 Open queueing networks: Jackson networks -- 3.4 Discussion of papers --
4. Markov chains -- 4.1 Markov chain for a closed network -- 4.2 Markov chain for a multi-class network -- 4.3 State aggregation -- 4.4 Discussion of papers --
5. Closed systems -- 5.1 Poisson Arrivals See Time Averages (PASTA) -- 5.2 Arrival theorem -- 5.3 Mean Value Analysis (MVA) -- 5.4 Discussion of papers --
6. Bottlenecks and flow equivalence -- 6.1 Bottleneck analysis -- 6.2 Flow equivalence -- 6.3 Equivalence between open and closed -- 6.4 Discussion of papers --
7. Deterministic approximations -- 7.1 Average Value Approximation (AVA) -- 7.2 Fluid approximation -- 7.3 Discussion of papers --
8. Transient analysis -- 8.1 Decomposing an equilibrium -- 8.2 Epidemic models -- 8.3 Discussion of papers --
9. Experimental validation and analysis -- 9.1 Case study: database transaction locking -- 9.2 Model validation and experimental analysis -- 9.2.1 The need for validation -- 9.2.2 Data presentation -- 9.2.3 Real systems and workloads -- 9.2.4 Simulation -- 9.2.5 Parameter space reduction -- 9.2.6 Uninteresting regions of parameter space -- 9.2.7 Quantitative prediction vs. qualitative understanding -- 9.2.8 Analytic validation -- 9.3 Discussion of papers --
Part of: Synthesis digital library of engineering and computer science.
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
System requirements: Adobe Acrobat Reader.
Includes bibliographical references (pages 139-145) and index.
Synthesis digital library of engineering and computer science
Synthesis lectures on computer science ; # 10