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

arXiv: https://arxiv.org/abs/2106.05475 · HTML: https://mlsanity.com/paper/2106.05475/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Jun 2021.

## Built on by (most cited first, 1 of 1)

- [Design and Optimization of Hierarchical Gradient Coding for Distributed Learning at Edge Devices](https://mlsanity.com/paper/2406.10831/) (2024)

## Abstract (arXiv)

This work aims to jointly optimize the coding and node selection to minimize the processing time for distributed computing tasks over wireless edge networks. Since the joint optimization problem formulation is NP-hard and nonlinear, we leverage the discrete characteristic of its decision variables to transform the problem into an equivalent linear formulation. This linearization can guarantee to find the optimal solutions and significantly reduce the problem's complexity. Simulations based on real-world datasets show that the proposed approach can reduce the total processing time up to 2.3 times compared with that of state-of-the-art approach.