---

Performance by Design: Computer Capacity Planning By Example

ISBN: 0130906735
EAN: 2147483647

Year: 2003
Pages: 166

Authors: Daniel A. Menasce, Lawrence W. Dowdy, Virgilio A.F. Almeida

BUY ON AMAZON

• Performance by Design: Computer Capacity Planning by Example
• Table of Contents
• Copyright
• Preface
• Goal, Theme, and Approach
• Part I: The Practice of Performance Engineering
• Chapter 1. Computer System Lifecycle
• 1.1 Introduction
• 1.2 QoS in IT Systems
• 1.3 System Life Cycle
• 1.4 A Reference Model for IT Systems
• 1.5 Concluding Remarks
• 1.6 Exercises
• Bibliography
• Chapter 2. From Systems to Descriptive Models
• 2.1 Introduction
• 2.2 Modeling
• 2.3 A Simple Database Server Example
• 2.4 The Database Server Example: Multiple Classes
• 2.5 The Database Server Example: Open and Closed Classes
• 2.6 The Database Server Example: a Mixed Model
• 2.7 The Database Server Example: Types of Resources
• 2.8 The Database Server Example: Blocking
• 2.9 The Database Server Example: Software Contention
• 2.10 Database Example: Simultaneous Resource Possession
• 2.11 Database Example: Class Switching
• 2.12 Database Example: Queuing Disciplines
• 2.13 QN Models
• 2.14 Concluding Remarks
• 2.15 Exercises
• Bibliography
• Chapter 3. Quantifying Performance Models
• 3.1 Introduction
• 3.2 Basic Performance Results
• 3.3 Bounds on Performance
• 3.4 Using QN Models
• 3.5 Concluding Remarks
• 3.6 Exercises
• Bibliography
• Chapter 4. Performance Engineering Methodology
• 4.1 Introduction
• 4.2 Performance Engineering
• 4.3 Motivating Example
• 4.4 A Model-based Methodology
• 4.5 Workload Model
• 4.6 Performance Models
• 4.7 Specifying Performance Objectives
• 4.8 Concluding Remarks
• 4.9 Exercises
• Bibliography
• Chapter 5. Case Study I: A Database Service
• 5.1 Introduction
• 5.2 Database Service Example
• 5.3 Building a Performance Model
• 5.4 Using the Model
• 5.5 Monitoring Tools
• 5.6 Measurements Techniques
• 5.7 Obtaining Input Parameters
• 5.8 Concluding Remarks
• 5.9 Exercises
• Bibliography
• Chapter 6. Case Study II: A Web Server
• 6.1 Introduction
• 6.2 The Web Server
• 6.3 Preliminary Analysis of the Workload
• 6.4 Building a Performance Model
• 6.5 Using the Model
• 6.6 Secure Downloads
• 6.7 Experimental Comparison of Two Servers
• 6.8 Concluding Remarks
• 6.9 Exercises
• Bibliography
• Chapter 7. Case Study III: A Data Center
• 7.1 Introduction
• 7.2 The Data Center
• 7.3 Building a Model
• 7.4 Using the Model
• 7.5 Another Modeling Approach
• 7.6 A Cost Analysis
• 7.7 Concluding Remarks
• 7.8 Exercises
• Bibliography
• Chapter 8. Case Study IV: An E-Business Service
• 8.1 Introduction
• 8.2 The E-Business Service
• 8.3 The E-Business Workload
• 8.4 Building a Performance Model
• 8.5 Using the Performance Model
• 8.6 Adding More Servers
• 8.7 Concluding Remarks
• 8.8 Exercises
• Bibliography
• Chapter 9. Case Study V: A Help-Desk Service
• 9.1 Introduction
• 9.2 The Help Desk Service
• 9.3 A Performance Model
• 9.4 Techniques for SPE
• 9.5 Concluding Remarks
• 9.6 Exercises
• Bibliography
• Part II: The Theory of Performance Engineering
• Chapter 10. Markov Models
• 10.1 Introduction
• 10.2 Modeling Context
• 10.3 Motivating Examples
• 10.4 Model Construction
• 10.5 Model Solution
• 10.6 Model Interpretation
• 10.7 Model Assumptions and Limitations
• 10.8 Generalized Birth-Death Models
• 10.9 Beyond the Basics
• 10.10 Chapter Summary
• 10.11 Exercises
• Bibliography
• Chapter 11. Single Queue Systems
• 11.1 Introduction
• 11.2 Single Queue Single Server Systems
• 11.3 The MM1 Queue
• 11.4 The MG1 Queue
• 11.5 MG1 with Vacations
• 11.6 MG1 with Priorities
• 11.7 Approximation Results
• 11.8 Concluding Remarks
• 11.9 Exercises
• Bibliography
• Chapter 12. Single Class MVA
• 12.1 Introduction
• 12.2 MVA Development
• 12.3 The MVA Algorithm
• 12.4 Balanced Systems
• 12.5 MVA Extensions and Limitations
• 12.6 Chapter Summary
• 12.7 Exercises
• Bibliography
• Chapter 13. Queuing Models with Multiple Classes
• 13.1 Introduction
• 13.2 The Need for Multiple-Class Models
• 13.3 Simple Two-Class Model
• 13.4 Notation and Assumptions
• 13.5 Closed Models
• 13.6 Open Models
• 13.7 Mixed Models
• 13.8 Concluding Remarks
• 13.9 Exercises
• Bibliography
• Chapter 14. Queuing Models with Load Dependent Devices
• 14.1 Introduction
• 14.2 Motivating Example
• 14.3 Single Class Models with LD Devices
• 14.4 Multiclass Closed Models with LD Devices
• 14.5 Multiclass Open Models with LD Devices
• 14.6 Flow-Equivalent Server Method
• 14.7 Concluding Remarks
• 14.8 Exercises
• Bibliography
• Chapter 15. Non Product-Form Queuing Models
• 15.1 Introduction
• 15.2 Modeling High Service Time Variability
• 15.3 Modeling Blocking Effects
• 15.4 Modeling Priority Scheduling
• 15.5 Modeling Software Contention
• 15.6 Modeling ForkJoin Queuing Networks
• 15.7 Concluding Remarks
• 15.8 Exercises
• Bibliography