SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis for batched disk scheduling and increasing subsequences
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Disk scheduling policies with lookahead
ACM SIGMETRICS Performance Evaluation Review
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
Random Arc Allocation and Applications
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Optimal Scheduling Algorithms for Tertiary Storage
Distributed and Parallel Databases
On the Guaranteed Throughput of Multizone Disks
IEEE Transactions on Computers
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
Issues and Challenges in the Performance Analysis of Real Disk Arrays
IEEE Transactions on Parallel and Distributed Systems
G-SCAN: a novel real-time disk scheduling using grouping and branch-and-bound strategy
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Airplane boarding, disk scheduling and space-time geometry
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Analysis of the GSTF disk scheduling algorithm
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk I/O performance will become an important bottleneck. Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. We consider the following disk scheduling problem. Given a set of requests on a computer disk and a convex reachability function which determines how fast the disk head travels between tracks, our goal is to schedule the disk head so that it services all the requests in the shortest time possible. We present a 3/2-approximation algorithm (with a constant additive term). For the special case in which the reachability function is linear we present an optimal polynomial-time solution. The disk scheduling problem is related to the special case of the asymmetric Traveling Salesman Problem with the triangle inequality (ATSP-/spl Delta/) in which all distances are either 0 or some constant /spl alpha/. We show how to find the optimal tour in polynomial time and describe how this gives another approximation algorithm for the disk scheduling problem. Finally we consider the on-line version of the problem in which uniformly-distributed requests arrive over time. We present an algorithm (related to the above ATSP-/spl Delta/) that appears to give higher throughput than previously existing head scheduling algorithms.