Logical Data Set Size Algorithm
Original Publication Date: 1986-Aug-01
Included in the Prior Art Database: 2005-Mar-09
This article is related to the next article in this bulletin. The described algorithm can enhance record selection when applied page data sets such as represented by the example below. Page data sets may reside on non-cached direct-access storage devices (DASDs), and which are formatted into contiguous records on the data set. A record is available if it is currently not allocated to any user of the data set. It may or may not contain previously written data. This algorithm locates a record at a user's request. After allocation to a user, he may read from or write to the record. When searching for available records in a data set, the algorithm attempts to limit the area of search to a "logical data set" which is a dynamically varying subset of the physically defined data set.