Original Publication Date: 1982-Oct-01
Included in the Prior Art Database: 2005-Feb-10
A system is described for dynamically allocating buffer space among a number of input/output units, e.g., disk files. This system is characterized by the step of redistributing the available buffer space at the time a new file is opened among all the open files. The algorithm for redistributing space involves the concept of "stealing" buffer space from a "rich" unit and allocating the space to a "poor" unit. It is generally well known that the throughput of a computer system can be improved by lookahead reads of data files and delayed output to such files. Variations of memory size, device geometry, record size and access predictability classically restrict the optimization of such data file accesses. When device buffers are hard-allocated to files, memory goes to waste.