Amortized efficiency of list update and paging rules
Communications of the ACM
Journal of Algorithms
Web caching with request reordering
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for the shortest common supersequence
Nordic Journal of Computing
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Developments from a June 1996 seminar on Online algorithms: the state of the art
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ACM SIGACT News
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)
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
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
Almost tight bounds for reordering buffer management
Proceedings of the forty-third annual ACM symposium on Theory of computing
Evaluation of online strategies for reordering buffers
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exploiting locality: approximating sorting buffers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A note on sorting buffers offline
Theoretical Computer Science
Offline sorting buffers on line
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
NP-hardness of the sorting buffer problem on the uniform metric
Discrete Applied Mathematics
Optimal online buffer scheduling for block devices
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A bicriteria approximation for the reordering buffer problem
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We introduce the online scheduling problem for sorting buffers. A service station and a sorting buffer are given. An input sequence of items which are only characterized by a specific attribute has to be processed by the service station which benefits from consecutive items with the same attribute value. The sorting buffer which is a random access buffer with storage capacity for k items can be used to rearrange the input sequence. The goal is to minimize the cost of the service station, i.e., the number of maximal subsequences in its sequence of items containing only items with the same attribute value. This problem is motivated by many applications in computer science and economics.The strategies are evaluated in a competitive analysis in which the cost of the online strategy is compared with the cost of an optimal offline strategy. Our main result is a deterministic strategy that achieves a competitive ratio of O(log2 k). In addition, we show that several standard strategies are unsuitable for this problem, i.e., we prove a lower bound of 驴(驴k) on the competitive ratio of the First In First Out (FIFO) and Least Recently Used (LRU) strategy and of 驴(k) on the competitive ratio of the Largest Color First (LCF) strategy.