|Title:||Should the Two-Headed Disk Be Greedy?
|Abstract:||We consider a disk with two movable arms, each of which can access all of its surface. Read/write requests arrive singly and are treated as they arrive (no queue is formed). The arms can move concurrently but not transmit simultaneously. We show that the policy that minimizes the mean seek time is to move to the required address the arm that is closest to it, while the other arm jockeys for optimal anticipatory position. This remains true when successive addresses are dependent and/or have different distributions.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1982/CS/CS0250), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1982
To the main CS technical reports page
Computer science department, Technion