One technique often employed to improve retrieval performance from storage devices is to red;cee seek costs by to clusterin quently accessed data toget er ‘ii R locations on the storage device that are ph sically close. For magnetic disks etermlning the best position B on the disk to place frequently accessed data is strai optical disks with htforwarcl, for t eir fi many different recording formats the solution is much more difficult. We develop a detailed model for the E lacement of data on Constant inear Velocity (CLV) format optical disks that includes distribution of stora e ca acity across the disks surface whit is variable for CLV “t R format optical disks), the seek erformance of the disk drive, de avs r dye ,to yotational latency, and t& &l;on of ac$esses ovet We derive closed form expressio;s which determine the position of frequently accessed data that will minimize the expected cost of random accesses to the data set.
[1]
Harvey F. Silverman,et al.
Placement of Records on a Secondary Storage Device to Minimize Access Time
,
1973,
JACM.
[2]
Chak-Kuen Wong,et al.
Algorithmic Studies in Mass Storage Systems
,
1983,
Springer Berlin Heidelberg.
[3]
Chak-Kuen Wong,et al.
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
,
1980,
CSUR.
[4]
Guy M. Lohman,et al.
Proceedings of the 17th International Conference on Very Large Data Bases
,
1991,
VLDB 1991.
[5]
R. S. Fabry,et al.
A fast file system for UNIX
,
1984,
TOCS.
[6]
Chak-Kuen Wong,et al.
On the Optimality of the Probability Ranking Scheme in Storage Applications
,
1973,
JACM.
[7]
Daniel Alexander Ford.
Performance optimizations for optical disc architectures
,
1992
.