Optimum Head Separation in a Disk System with Two Read/Write Heads
Journal of the ACM (JACM)
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Analysis of retrieval performance for records and objects using optical disk technology
ACM Transactions on Database Systems (TODS)
Optimal directory placement on disk storage devices
Journal of the ACM (JACM)
File organization for database design
File organization for database design
Probability distributions for seek time evaluation
Information Sciences: an International Journal
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Optimum reorganization points for linearly growing files
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
ACM Computing Surveys (CSUR)
Estimating block accesses and number of records in file management
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
IEEE Transactions on Software Engineering
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
| Hi-index | 0.00 |
Disk drives with movable two-headed arms are now commercially available. The two heads are separated by a fixed number of cylinders. A major problem for optimizing disk head movement, when answering database requests, is the specification of the optimum number of cylinders separating the two heads. An earlier analytical study assumed a FCFS model and concluded that the optimum separation distance should be equal to 0.44657 of the number of cylinders N of the disk. This paper considers that the SCAN scheduling policy is used in file access, and it applies combinatorial analysis to derive exact formulas for the expected head movement. Furthermore, it is proven that the optimum separation distance is N/2 - 1 (⌈N/2 - 1⌉ and ⌊N/2 - 1⌋) if N is even (odd). In addition, a comparison with a single-headed disk system operating under the same scheduling policy shows that if the two heads are optimally spaced, then the mean seek distance is less than one-half of the value obtained with one head. In fact that the SCAN policy is used for many database applications (for example,batching and secondary key retrieval) demonstrates the potential of two-headed disk systems for improving the performance of database systems.