# Coded Distributed Computing Under Combination Networks

## TL;DR

This paper introduces a new method for efficient communication in distributed computing systems using coded techniques in combination networks.

## Contribution

A novel transmission scheme for the shuffle phase using a coefficient matrix and Combined Placement Delivery Array (CPDA) is proposed.

## Key findings

- The proposed scheme improves uplink and downlink communication loads in (H,L)-combination networks.
- The method maintains robustness and efficiency in combined multi-AP networks.
- The approach outperforms baseline schemes in communication performance.

## Abstract

Coded distributed computing (CDC) is a powerful approach to reduce the communication overhead in distributed computing frameworks by utilizing coding techniques. In this paper, we focus on the CDC problem in (H,L)-combination networks, where H APs act as intermediate pivots and K=HL workers are connected to different subsets of L APs. Each worker processes a subset of the input file and computes intermediate values (IVs) locally, which are then exchanged via uplink and downlink transmissions through the AP station to ensure that all workers compute their assigned output functions. In this paper, we first novelly characterize the transmission scheme for the shuffle phase from the view point of the coefficient matrix and then obtain the scheme by using the Combined Placement Delivery Array (CPDA). Compared with the baseline scheme, our scheme significantly improves the uplink and downlink communication loads while maintaining the robustness and efficiency of the combined multi-AP network.