Optimal I/O Buffer Size for Multi-Programming
| dc.contributor.author | Kho, James Wang | en_US |
| dc.contributor.author | Pinkerton, Tad Brian | en_US |
| dc.date.accessioned | 2012-03-15T16:19:38Z | |
| dc.date.available | 2012-03-15T16:19:38Z | |
| dc.date.created | 1971 | en_US |
| dc.date.issued | 1971 | en |
| dc.description.abstract | The question of an optimal 1/0 buffer size for multiprogramming is considered by analyzing a probability model of the operations of multiprogramming. A11 algorithm is given for finding the optimal solution based on number of jobs in core, length of programs, number of I/O requests, and other parameters. Statistics obtained from the UWCC 1108 system are used in the experimental work. A simulation program is done in SIMSCRIPT and the analysis of the results herein presented. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | TR107 | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/57662 | |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | Optimal I/O Buffer Size for Multi-Programming | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1