Optimize Coding and Node Selection for Coded Distributed Computing over Wireless Edge Networks

This paper aims to develop a highly-effective framework to significantly enhance the efficiency in using coded computing techniques for distributed computing tasks over heterogeneous wireless edge networks. In particular, we first formulate a joint coding and node selection optimization problem to m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC s. 1248 - 1253
Hlavní autori: Nguyen, Cong T., Nguyen, Diep N., Hoang, Dinh Thai, Pham, Hoang-Anh, Dutkiewicz, Eryk
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 10.04.2022
Predmet:
ISSN:1558-2612
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper aims to develop a highly-effective framework to significantly enhance the efficiency in using coded computing techniques for distributed computing tasks over heterogeneous wireless edge networks. In particular, we first formulate a joint coding and node selection optimization problem to minimize the expected total processing time for computing tasks, taking into account the heterogeneity in the nodes' computing resources and communication links. The problem is shown to be NP-hard. To circumvent it, we leverage the unique characteristic of the problem to develop a linearization approach and a hybrid algorithm based on binary search and branch-and-bound (BB) algorithms. This hybrid algorithm can not only guarantee to find the optimal solution, but also significantly reduce the computational complexity of the BB algorithm. Simulations based on real-world datasets show that the proposed approach can reduce the total processing time up to 2.4 times compared with that of state-of-the-art approach, even without perfect knowledge regarding the node's performance and their straggling parameters.
ISSN:1558-2612
DOI:10.1109/WCNC51071.2022.9771781