Optimizing the paging of information blocks on a magnetic disc with moving heads

The problem of optimal information block paging is formulated for a magnetic disc with moving heads for dependent accesses of the blocks. The objective of optimization is reduction of the number of head placements in the accessing process. An algorithm for finding locally optimal placements is proposed and an example of its application given.