Hierarchical Coding for Distributed Computing

Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of groups of workers, motivated by the need to reflect the arc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 IEEE International Symposium on Information Theory (ISIT) s. 1630 - 1634
Hlavní autoři: Park, Hyegyeong, Lee, Kangwook, Sohn, Jy-Yong, Suh, Changho, Moon, Jaekyun
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2018
Témata:
Computational modeling
Decoding
Distributed computing
Encoding
Switches
Task analysis
ISSN:2157-8117
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of groups of workers, motivated by the need to reflect the architectures of real-world distributed computing systems. In this work, we propose a hierarchical coding scheme for this model, as well as analyze its decoding cost and expected computation time. Specifically, we first provide upper and lower bounds on the expected computing time of the proposed scheme. We also show that our scheme enables efficient parallel decoding, thus reducing decoding costs by orders of magnitude over non-hierarchical schemes. When considering both decoding cost and computing time, the proposed hierarchical coding is shown to outperform existing schemes in many practical scenarios.
ISSN:2157-8117
DOI:10.1109/ISIT.2018.8437669