ACM Home Page
Please provide us with feedback. Feedback
Analysis of disk arm movement for large sequential reads
Full text PdfPdf (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
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/137097.137108
What is a DOI?

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
 
REBA89
 
SIT86
Sitler, et al. Configuring tgiskr,. Tandem System Review, December 1986
YU89
 
WONG83