Queueing Discipline for Hard File Adapters
Original Publication Date: 1987-Feb-01
Included in the Prior Art Database: 2005-Jan-31
A queueing discipline for hard files is described which allows data sets on hard files which consist of numerous contiguous data blocks to be efficiently accessed. It is most applicable to a system containing several hard files controlled by a single adapter card. The queue discipline allows the adapter card to employ a very simple scheduling algorithm, yet it provides many of the benefits of much more complex and expensive queueing schemes. The scheduling algorithm is a modification of a Round Robin (RR) job execution order, with each job of the RR consisting of a first-in, first-out (FIFO) queue of jobs. The algorithm is outlined below for a system containing n hard files.