| Analysis of disk arm movement for large sequential reads |
| Full text |
Pdf
(637 KB)
|
| Source
|
Symposium on Principles of Database Systems
archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
table of contents
San Diego, California, United States
Pages: 47 - 54
Year of Publication: 1992
ISBN:0-89791-519-4
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 1
|
|
|
ABSTRACT
The common model for analyzing seek distances on a magnetic disk uses a continuous approximation in which the range of motion of the disk arm is the interval [0,1]. In this model, both the current location of the disk arm and the location of the next request are assumed to be points uniformly distributed on the interval [0,1] and therefore the expected seek distance to service the next request is 1/3. In many types of databases including scientific, object oriented, and multimedia database systems, a disk service request may involve fetching very large objects which must be transferred from the disk without interruption. In this paper we show that the common model does not accurately reflect disk arm movement in such cases as both the assumption of uniformity and the range of motion of the disk arm may depend on the size of the objects. We propose a more accurate model that takes into consideration the distribution of the sizes of the objects fetched as well as the disk arm scheduling policy. We provide closed form expressions for the expected seek distance in this model under various assumptions on the distribution of object sizes and the capability of the disk arm to read in both directions and to correct its position before the next read is performed.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
BIGR88
|
|
| |
COFF72
|
Coffman, E.G. Klimko, L. and Ryan B, Analysis of Scanning Policies for Reducing Disk Seek Times. SIAM J. on Computing. 1,3, pp 269-279, September 1972
|
| |
GER92
|
Gerchak, Yigal. Private Communication.
|
| |
GRAQ
|
|
| |
HOFR83
|
Hofri, M. Should the Two Headed Disk be Greedy? Yes It Should. Inf. Processing Letters., 16, pp 83- 85,
|
| |
KIM86
|
|
 |
KING90
|
|
| |
KOEL91
|
|
| |
NG91
|
|
 |
PGKA88
|
David A. Patterson , Garth Gibson , Randy H. Katz, A case for redundant arrays of inexpensive disks (RAID), Proceedings of the 1988 ACM SIGMOD international conference on Management of data, p.109-116, June 01-03, 1988, Chicago, Illinois, United States
|
| |
REBA89
|
|
| |
SIT86
|
Sitler, et al. Configuring tgiskr,. Tandem System Review, December 1986
|
 |
YU89
|
Clement Yu , Wei Sun , Dina Bitton , Qi Yang , Richard Bruno , John Tullis, Efficient placement of audio data on optical disks for real-time applications, Communications of the ACM, v.32 n.7, p.862-871, July 1989
[doi> 10.1145/65445.65453]
|
| |
WONG83
|
|
CITED BY
|
|
Reuven Bar-Yehuda , Magnús M. Halldórsson , Joseph (Seffi) Naor , Hadas Shachnai , Irina Shapira, Scheduling split intervals, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.732-741, January 06-08, 2002, San Francisco, California
|
|