Adaptive block rearrangement
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 13 (2) , 89-121
- https://doi.org/10.1145/201045.201046
Abstract
An adaptive technique for reducing disk seek times is described. The technique copies frequently referenced blocks from their original locations to reserved space near the middle of the disk. Reference frequencies need not be known in advance. Instead, they are estimated by monitoring the stream of arriving requests. Trace-driven simulations show that seek times can be cut substantially by copying only a small number of blocks using this technique. The technique has been implemented by modifying a UNIX device driver. No modifications are required to the file system that uses the driver.Keywords
This publication has 9 references indexed in Scilit:
- Disk arm movement in anticipation of future requestsACM Transactions on Computer Systems, 1990
- A system for adaptive disk rearrangementSoftware: Practice and Experience, 1990
- Directory reference patterns in hierarchical file systemsIEEE Transactions on Knowledge and Data Engineering, 1989
- A continuum of disk scheduling algorithmsACM Transactions on Computer Systems, 1987
- A trace-driven analysis of the UNIX 4.2 BSD file systemPublished by Association for Computing Machinery (ACM) ,1985
- A fast file system for UNIXACM Transactions on Computer Systems, 1984
- Disk schedulingCommunications of the ACM, 1980
- Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage SystemsACM Computing Surveys, 1980
- Placement of Records on a Secondary Storage Device to Minimize Access TimeJournal of the ACM, 1973