Thumbnail
Access Restriction
Subscribed

Author Cotten, L. W. ♦ Abd-Alla, A. M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Compute-output processing times are determined for $\textit{n}-segment$ jobs that are preloaded into main storage and processed with overlap. A queueing model with tandem servers is utilized for the performance analysis. In particular, the solution presented involves determination of the transient response for a batched arrival of $\textit{n}$ segments to be processed through two stages of tandem service with unlimited output buffering. The performance results provide insight into conditions arising in systems consisting of a single CPU and I/O channel with overlap capabilities. Two cases, single-segment overlap and unlimited overlap, are considered. Segmental compute and output (or input) service times are taken to be exponentially distributed; however, the approach is not limited to the exponential case if service is independent. The ratio of mean output time to mean compute time is varied to explore the full range between compute-bound and output-bound extremes. Final results are presented as relative gain over sequential processing.
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 1974-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 1
Page Count 13
Starting Page 18
Ending Page 30


Open content in new tab

   Open content in new tab
Source: ACM Digital Library