DocumentCode
2277829
Title
Adaptive blocks rearrangement
Author
Akyürek, Sedat ; Salem, Kenneth
Author_Institution
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
fYear
1993
fDate
19-23 Apr 1993
Firstpage
182
Lastpage
189
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 center of the disk. Reference frequencies need not be known in advance. Instead, they are estimated by monitoring the stream of arriving requests. Results of trace-driven simulations show that seek times can be cut in half by copying only a small number of blocks using this technique. The technique is designed to be implemented in a device driver or controller. It is independent of the file system or database manager that uses the disk
Keywords
discrete event simulation; file organisation; adaptive block rearrangement; block copying; controller; database manager; device driver; disk seek times; file system; frequently referenced blocks; reference frequency estimation; request stream arrival monitoring; reserved space; trace-driven simulations; Computer science; Control systems; Database systems; Educational institutions; File systems; Frequency estimation; Monitoring; Predictive models; Random processes; Temperature;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1993. Proceedings. Ninth International Conference on
Conference_Location
Vienna
Print_ISBN
0-8186-3570-3
Type
conf
DOI
10.1109/ICDE.1993.344064
Filename
344064
Link To Document