Polylogarithmic guarantees for generalized reordering buffer management

Matthias Englert, Harald Racke, Richard Stotz

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

Abstract

In the Generalized Reordering Buffer Management Problem (GRBM) a sequence of items located in a metric space arrives online, and has to be processed by a set of k servers moving within the space. In a single step the first b still unprocessed items from the sequence are accessible, and a scheduling strategy has to select an item and a server. Then the chosen item is processed by moving the chosen server to its location. The goal is to process all items while minimizing the total distance travelled by the servers. This problem was introduced in [Chan, Megow, Sitters, van Stee TCS 12] and has been subsequently studied in an online setting by [Azar, Englert, Gamzu, Kidron STACS 14]. The problem is a natural generalization of two very well-studied problems: The k-server problem for b=1 and the Reordering Buffer Management Problem (RBM) for k=1. In this paper we consider the GRBM problem on a uniform metric in the online version. We show how to obtain a competitive ratio of O(log k(log k+loglog b)) for this problem. Our result is a drastic improvement in the dependency on b compared to the previous best bound of O(√b log k), and is asymptotically optimal for constant k, because Ω(log k + loglog b) is a lower bound for GRBM on uniform metrics.

OriginalspracheEnglisch
TitelProceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019
Herausgeber (Verlag)IEEE Computer Society
Seiten38-59
Seitenumfang22
ISBN (elektronisch)9781728149523
DOIs
PublikationsstatusVeröffentlicht - Nov. 2019
Veranstaltung60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019 - Baltimore, USA/Vereinigte Staaten
Dauer: 9 Nov. 201912 Nov. 2019

Publikationsreihe

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Band2019-November
ISSN (Print)0272-5428

Konferenz

Konferenz60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019
Land/GebietUSA/Vereinigte Staaten
OrtBaltimore
Zeitraum9/11/1912/11/19

Fingerprint

Untersuchen Sie die Forschungsthemen von „Polylogarithmic guarantees for generalized reordering buffer management“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren