Improved Analysis of Online Balanced Clustering

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10455475" target="_blank" >RIV/00216208:11320/21:10455475 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-92702-8_14" target="_blank" >https://doi.org/10.1007/978-3-030-92702-8_14</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-92702-8_14" target="_blank" >10.1007/978-3-030-92702-8_14</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Improved Analysis of Online Balanced Clustering

Popis výsledku v původním jazyce

In the online balanced graph repartitioning problem, one has to maintain a clustering of n nodes into ℓ clusters, each having k= n/ ℓ nodes. During runtime, an online algorithm is given a stream of communication requests between pairs of nodes: an inter-cluster communication costs one unit, while the intra-cluster communication is free. An algorithm can change the clustering, paying unit cost for each moved node. This natural problem admits a simple O(ℓ2. k2) -competitive algorithm Comp, whose performance is far apart from the best known lower bound of Ω(ℓ. k). One of open questions is whether the dependency on ℓ can be made linear; this question is of practical importance as in the typical datacenter application where virtual machines are clustered on physical servers, ℓ is of several orders of magnitude larger than k. We answer this question affirmatively, proving that a simple modification of Comp is (ℓ. 2O(k)) -competitive. On the technical level, we achieve our bound by translating the problem to a system of linear integer equations and using Graver bases to show the existence of a &quot;small&quot; solution.

Název v anglickém jazyce

Improved Analysis of Online Balanced Clustering

Popis výsledku anglicky

In the online balanced graph repartitioning problem, one has to maintain a clustering of n nodes into ℓ clusters, each having k= n/ ℓ nodes. During runtime, an online algorithm is given a stream of communication requests between pairs of nodes: an inter-cluster communication costs one unit, while the intra-cluster communication is free. An algorithm can change the clustering, paying unit cost for each moved node. This natural problem admits a simple O(ℓ2. k2) -competitive algorithm Comp, whose performance is far apart from the best known lower bound of Ω(ℓ. k). One of open questions is whether the dependency on ℓ can be made linear; this question is of practical importance as in the typical datacenter application where virtual machines are clustered on physical servers, ℓ is of several orders of magnitude larger than k. We answer this question affirmatively, proving that a simple modification of Comp is (ℓ. 2O(k)) -competitive. On the technical level, we achieve our bound by translating the problem to a system of linear integer equations and using Graver bases to show the existence of a &quot;small&quot; solution.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GX19-27871X" target="_blank" >GX19-27871X: Efektivní aproximační algoritmy a obvodová složitost</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISBN

978-3-030-92701-1

ISSN

—

e-ISSN

1611-3349

Počet stran výsledku

10

Strana od-do

224-233

Název nakladatele

Springer Nature

Místo vydání

Neuveden

Místo konání akce

Lisabon

Datum konání akce

9. 9. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—