Performance of Movable-Head Disk Storage Devices
Journal of the ACM (JACM)
Modeling and performance of MEMS-based storage devices
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Disk scheduling: FCFS vs.SSTF revisited
Communications of the ACM
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Issues and Challenges in the Performance Analysis of Real Disk Arrays
IEEE Transactions on Parallel and Distributed Systems
Batched disk scheduling with delays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Airplane boarding, disk scheduling and space-time geometry
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
| Hi-index | 0.00 |
(MATH) We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. Given N requests, we show that if the seek function has positive derivative at 0 the tour length is concentrated in probability around the value Cf,pN1/2 for an explicit constant Cf,p dependent on the seek function and the distribution of requests. For linear seek function we provide even tighter bounds and provide an O(Nlog(N)) time algorithm for finding the optimal tour. The proof uses several results on the size and location of maximal increasing subsequences. To handle more general seek functions we introduce a more general concept of increasing subsequences. we provide order of magnitude estimates on the tour length for a wide class of seek functions with vanishing derivative at 0. For general seek functions we use some geometric information on the location of maximal generalized increasing subsequences obtained via Talagrand's isoperimetric inequalities to produce a probabilistic 1+&egr; approximation algorithm. These results complement the results on guaranteed approximation algorithms for this problem presented in [2].