Optimal Head Scheduling Rule to Minimize Batched Processing Time in Linear Storage
Original Publication Date: 1981-Jun-01
Included in the Prior Art Database: 2005-Feb-11
A method is described for minimizing the average access time for batche of records in linear store. Here, we consider the accessing of batched requests in linear storage, i.e., processing a fixed number (a batch) of requests at a time. We assume that consecutive accesses are independent and the frequencies are known. Access time is measured by the distance traveled by the read/write head.