The Library
Evaluation of online strategies for reordering buffers
Tools
Englert, Matthias, Roglin, H. and Westermann, M. (2006) Evaluation of online strategies for reordering buffers. In: Carme, Àlvarez and María, Serna, (eds.) Experimental Algorithms. Lecture Notes in Computer Science, Volume 4007 . Springer Verlag, pp. 183-194. ISBN 9783540345978
PDF
fulltext23.pdf Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (501Kb) |
Official URL: http://dx.doi.org/10.1007/11764298_17
Abstract
A sequence of objects which are characterized by their color has to be processed. Their processing order influences how efficiently they can be processed: Each color change between two consecutive objects produces costs. A reordering buffer which is a random access buffer with storage capacity for k objects can be used to rearrange this sequence online in such a way that the total costs are reduced. This concept is useful for many applications in computer science and economics.
The strategy with the best known competitive ratio is MAP. An upper bound of O(log k) on the competitive ratio of MAP is known and a non-constant lower bound on the competitive ratio is not known [2]. Based on theoretical considerations and experimental evaluations, we give strong evidence that the previously used proof techniques are not suitable to show an $o(\sqrt{\log k})$ upper bound on the competitive ratio of MAP. However, we also give some evidence that in fact MAP achieves a competitive ratio of O(1).
Further, we evaluate the performance of several strategies on random input sequences experimentally. MAP and its variants RC and RR clearly outperform the other strategies FIFO, LRU, and MCF . In particular, MAP, RC, and RR are the only known strategies whose competitive ratios do not depend on the buffer size. Furthermore, MAP achieves the smallest constant competitive ratio.
Item Type: | Book Item | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Series Name: | Lecture Notes in Computer Science | ||||
Publisher: | Springer Verlag | ||||
ISBN: | 9783540345978 | ||||
Book Title: | Experimental Algorithms | ||||
Editor: | Carme, Àlvarez and María, Serna | ||||
Official Date: | 2006 | ||||
Dates: |
|
||||
Volume: | Volume 4007 | ||||
Page Range: | pp. 183-194 | ||||
DOI: | 10.1007/11764298_17 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |