This text was published by Prentice-Hall, Inc., in 1984. It remains the definitive work on analytic modelling of computer systems. The publisher has returned the copyright to the authors, who make the material available here for viewing or downloading, in Adobe Acrobat PDF format.

START HERE -- The easiest way to access the book online is through the hyperlinked Table of Contents available through this link.

Want to download the entire text to your PC? 21MB zip file .

• Contents
• Preface
• I. Preliminaries
  • 1. An Overview of Queueing Network Modelling
  • 2. Conducting a Modelling Study
  • 3. Fundamental Laws
  • 4. Queueing Network Model Inputs and Outputs
• II. General Analytic Techniques
  • 5. Bounds on Performance
  • 6. Models with One Job Class
  • 7. Models with Multiple Job Classes
  • 8. Flow Equivalence and Hierarchical Modelling
• III. Representing Specific Subsystems
  • 9. Memory
  • 10. Disk I/O
  • 11. Processors
• IV. Parameterization
  • 12. Existing Systems
  • 13. Evolving Systems
  • 14. Proposed Systems
• V. Perspective
  • 15. Extended Applications
  • 16. Using Queueing Network Modelling Software
• VI. Appendices
  • 17. Constructing a Model from RMF Data
  • 18. An Implementation of Single Class, Exact MVA
  • 19. An Implementation of Multiple Class, Exact MVA
  • 20. Load Dependent Service Centers
• Index

lazowska@cs.washington.edu