Abstract
This paper is concerned with the problem of data re-allocation on a moving-head-disk, in order to minimize the average access time. From the analysis of the chronological accesses to the records during the reference period, the initial exploitation cost of the implementation is situated among all the possible ones, and the benefit of a reorganization may be evaluated. The reorganization itself is a two stage process: at first the file is partitioned by a clustering algorithm, and then, the clusters are allocated to cylinders. By the application of this method on a 11,000-record file, the access mean time was reduced by a factor 2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
