Applied operating system concepts
Applied operating system concepts
Algorithms for Capacitated Vehicle Routing
SIAM Journal on Computing
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Finite Capacity Dial-A-Ride Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Evaluation of online strategies for reordering buffers
Journal of Experimental Algorithmics (JEA)
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms (TALG)
Improved online algorithms for the sorting buffer problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Evaluation of online strategies for reordering buffers
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Offline sorting buffers on line
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
We consider the online scheduling problem for sorting buffers on a line metric, motivated by an application to disc scheduling. Input is an online sequence of requests. Each request is a block of data to be written on a specified track of the disc. To write a block on a particular track, the scheduler has to bring the disc head to that track. The cost of moving the disc head from a track to another is the distance between those tracks. A sorting buffer that can store at most k requests at a time is available to the scheduler. This buffer can be used to rearrange the input sequence. The objective is to minimize the total cost of head movement while serving the requests. On a disc with n uniformly-spaced tracks, we give a randomized online algorithm with a competitive ratio of O(log2n) in expectation against an oblivious adversary. We show that any deterministic strategy which makes scheduling decisions based only on the contents of the buffer has a competitive ratio of Ω(k) or Ω(log n/loglog n).