Often the arrangement of frequency dependent data such as pages on a sequential memory such as disks or tapes critically affects the turnaround time of real-time or dedicated mode processes. Since the size of typical problems renders exact solution techniques impractical, a fast, efficient heuristic procedure becomes very useful. This paper describes such a procedure which is applicable to a general class of objective functions corresponding to seek time functions constrained to be only monotonically piecewise linear.
['C. V. Ramamoorthy', 'Parker R. Blevins']
Arranging frequency dependent data on sequential memories