mardi
Uploaded by
8 SLIDES
223 VUES
80LIKES

Understanding Operational Laws for Effective Computer Systems Performance Analysis

DESCRIPTION

Operational laws provide valuable insights into computer systems performance, addressing common day-to-day issues without needing distribution assumptions for service and inter-arrival times. Initially identified by Buzen in 1976 and expanded by Denning and Buzen in 1978, these laws rely on directly measurable metrics to analyze system behaviors. Key concepts such as waiting time, utilization, and throughput are critical for performance evaluation. This guide covers fundamental laws like Little’s Law, response time law, and others, enhancing your understanding of system analysis and efficiency optimization.

1 / 8

Télécharger la présentation

Understanding Operational Laws for Effective Computer Systems Performance Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Operational Laws A large number of day-to-day problem in computer systems performance analysis can be solved by using some simple relationships that do not require any assumptions about distribution of service times or interarrival times. Several such relationships called operational laws were identified originally by Buzen (1976) and later extended by Denning and Buzen (1978). The word operational means directly measured. Thus, operationally testable assumptions are the assumptions that can be verified by measurements.

  2. W Accumulated waiting time T Length of an observation interval Ak Number of arrivals observed Ck Number of completions observed λk Arrivals rate Xk Throughput Bk Busy time Notation

  3. Notation (cont’d) Uk Utilization Sk Service requirement per visit N Customer population Rk Residence time Z Think time of a terminal user Vk Number of visits Dk Service demand

  4. Fundamental Laws The Utilization Law: Little’s Law:

  5. Fundamental Laws (cont’d) The Response Time Law: The Forced Flow Law:

  6. Additional Relationships

  7. More about Little’s Law Accumulated Time in System; Average Number of Requests in System; Average System Residence Time;

  8. More about Little’s Law (cont’d) N = X0 · R

More Related