Abstract
This chapter discusses some basic concepts needed for computer systems performance evaluation. The concept of service time-related resources is introduced. The fundamental concepts involved in probability density and probability distribution functions are developed. These are then used to develop basic definitions for expected or mean values, the nth moment of a distribution. The special second moment, called the central moment, is developed, as is the definition and formulation for variance and coefficient of variation. This chapter introduces priority scheduling, round-robin, first-come first served, last-come first-served, and the deadline-driven value function scheduling algorithms. It also discusses how these items relate to computer systems modeling. The relationship scheduling algorithms have with distribution functions is presented, as is their relationship to performance studies. The concept of what a workload is and how it is used in computer systems modeling is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computer Systems Performance Evaluation and Prediction
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
