E N D
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.
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
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
Fundamental Laws The Utilization Law: Little’s Law:
Fundamental Laws (cont’d) The Response Time Law: The Forced Flow Law:
More about Little’s Law Accumulated Time in System; Average Number of Requests in System; Average System Residence Time;
More about Little’s Law (cont’d) N = X0 · R