Thumbnail
Access Restriction
Subscribed

Author Price, Thomas G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Upper and lower bounds on processor utilization for the queueing model M/G/1/N are derived. The upper bound is equal to the utilization for constant service times and the lower bound is approached when the average number of operations per busy period approaches one. These bounds show that the form of the processing time distribution can have a substantial effect on processor utilization. We show that the utilization will be near the lower bound if there are a large number of short processing times. The variance does not always give an accurate indication of the effect of the distribution on utilization.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1976-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 2
Page Count 5
Starting Page 342
Ending Page 346


Open content in new tab

   Open content in new tab
Source: ACM Digital Library