Details

Autor(en) / Beteiligte

• Adamaszek, Anna
• Renault, Marc P.
• Rosén, Adi
• van Stee, Rob
• Kaklamanis, Christos
• Pruhs, Kirk

Titel

Reordering Buffer Management with Advice

Ist Teil von

• Approximation and Online Algorithms, p.132-143

Ort / Verlag

Cham: Springer International Publishing

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates cost. A reordering buffer of capacity k items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a scheduling strategy that, using the reordering buffer, minimizes the number of color changes in the given sequence of items. We consider the problem in the setting of online computation with advice. In this model, the color of an item becomes known only at the time when the item enters the reordering buffer. Additionally, together with each item entering the buffer, we get a fixed number of advice bits, which can be seen as information about the future or as information about an optimal solution (or an approximation thereof) for the whole input sequence. We show that for any ε > 0 there is a (1 + ε)-competitive algorithm for the problem which uses only a constant (depending on ε) number of advice bits per input item. We complement the above result by presenting a lower bound of Ω(logk) bits of advice per request for an optimal deterministic algorithm.