Allocation Request Processing
Original Publication Date: 1986-Feb-01
Included in the Prior Art Database: 2005-Mar-08
In managing a multiprocessor-related extremely large data base, it is desired to reduce the time required to provide an efficient allocation of data storage space for satisfying an allocation request to store data. This reduction in time is particularly important where the data base is stored over a large plurality of peripheral data storage devices. Allocation request processing is divided into a plurality of allocation-satisfying evaluation steps. The first step requires the least attention by any one of the processors. For example, a plurality of mounted volumes have their indices stored within the processor as a first step in allocation. Such volume records are scanned to find a first, easy fit of data sets to be stored among the volume records.