Introduction - If you have any usage issues, please Google them yourself
Documents n f1, f2, ..., fn, each file on the disk occupied by a track provided on the disk. The probability of the n retrieval documents are p1, p2, ..., pn, and p1+p2+ ...+ pn = 1. The time required to move the head of the subject is available information track radial distance between these two tracks from the current track to measure. If the file is stored in the i-th track fi, 1 ≦ i ≦ n, the time to retrieve a desired file which is n for all i < j, time+ = pi* pj* d (i, j). Where d (i, j) is the radial distance of the i channel between the channel and the j | ij |. Optimal disk file storage issues required to determine these n files on disk storage location, so expect the search time to a minimum.