An Improved Competitive Algorithm for Reordering Buffer Management

Abstract

We design and analyze an online reordering buffer management algorithm with improved <i>O</i>(log <i>k</i>/log log <i>k</i>) competitive ratio for nonuniform costs, where <i>k</i> is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (2005) giving <i>O</i>(log <i>k</i>) competitive ratio, which was… (More)
DOI: 10.1145/2663347

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

01020201520162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics