Skip Navigation

The Computer Journal 1979 22(4):323-327; doi:10.1093/comjnl/22.4.323
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lazos, C.
Right arrow Articles by Vafiadis, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A method to estimate the I/O buffer size in a computer system

C. Lazos1 * and A. Vafiadis2

1 Computer Centre, Academic Division, University of Birmingham, P.O. Box 363, Birmingham, UK, 2 Department of Mathematics, University of Thessaloniki, Thessaloniki, Greece

Computer system throughput in a multiprogrammed environment is considered as buffer sizes are varied. The effects on jobs' I/O time, the degree of multiprogramming and the elapsed time are also considered. Bounds on the usefulness of decreasing jobs' elapsed time are derived. Simulation results are presented which indicate when and how some multiprogrammed systems can benefit from such buffer size changes.

Received November 1977.

* Now at Computer Centre, Academic Division, University of Birmingham, P.O. Box 363, Birmingham B15 2TT.

§ Department of Mathematics, University of Thessaloniki, Thessaloniki, Greece


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.