Optimal I/O Buffer Size for Multi-Programming
James Wang Kho, Tad Brian Pinkerton
1971
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.
Download this report (PDF)
Return to tech report index
|
