Average Case Analysis for Batched Disk Scheduling and Increasing Subsequences E.Bachmat 1 1 Technical O v e r v i e w Modern disk drives have the ability to queue incoming read and write requests and to service them in an out of order fashion. In the Batched disk scheduling problem we are given a batch of N queued requests and we wish to service them in an order which minimizes the total service time, or equivalently, the number of disk rotations required to service all N requests. Mechanical motion in the disk consists of two components the first is the inward/outward radial motion. The time spent by the disk head performing the first component of motion between successive requests is known as seek time. The second component of motion is the rotational motion of the disk around its axis, the time it takes between the arrival of the disk head to the proper radial location and the time the wanted data passes under the disk head is known as latency time. Given radial and angular distance units r and/9 the function f(O) is defined to be the radial distance which the disk head can travel starting and
/lp/association-for-computing-machinery/average-case-analysis-for-batched-disk-scheduling-and-increasing-Q3ts3YGDGg