Coded Distributed Computing Under Combination Networks

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=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$ 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.

1. Introduction

The rapid growth of computationally intensive applications has driven considerable research into efficient distributed computing frameworks. MapReduce [1,2] and its evolution Apache Spark [3] have significant advantages in computational tasks dealing with massive datasets, where the amount of data can usually reach tens of terabytes. The MapReduce framework distributes computation tasks to multiple nodes, each storing a subset of the dataset. The computation process is decomposed into a set of “map” functions and “reduce” functions. Each map function processes a batch of data to generate intermediate values (IVs), which serve as inputs to the reduce functions. The overall process comprises three main phases: map, shuffle, and reduce phases. The nodes compute the map functions on their locally stored data, generate output IVs during the map phase, and exchange their computed IVs to ensure that each reduce function accesses to all necessary inputs during the map phase. In the reduce phase, all the nodes compute their assigned reduce functions using the gathered IVs.

Due to massive data exchange and limited communication bandwidth, the MapReduce-type system (MapReduce in short) often suffers from communication bottlenecks, i.e., the data shuffle phase consumes a significant portion of the overall task execution time. In order to reduce the communication overhead during the shuffling phase, Li et al. in [4] proposed a CDC scheme which achieves an optimal tradeoff between the computation load and communication load under a given output function assignment. The CDC scheme has also been widely studied in the other distributed computing scenarios. For example, CDC has been combined with maximum distance separable (MDS) codes to handle matrix–vector multiplication tasks and mitigate the impact of stragglers [5]. There are also many workers focusing on the stragglers in general functions [6,7], optimal resource allocation strategies [8,9], iterative computing and shuffling procedures [10,11], randomized file allocations [12], and cases with random network connectivity [13].

The CDC technique has been extended to wireless networks [14,15], where devices exchange information via wireless links. In such scenarios, owing to the decentralized nature of wireless networks, a central access point (AP) is typically required to facilitate data exchange, giving rise to uplink and downlink communication phases [16,17,18]. In real-world scenarios, we usually consider multiple APs. For example, a large place like a university campus needs to deploy multiple APs to realize campus network coverage. Moreover, a multi-AP system is able to distribute the load to multiple repeaters, thus reducing the risk of a single point of failure and improving fault tolerance.

This paper considers the CDC problem in a wireless $(H,L)$-combination network [19] which consists of H numbers of APs and $K=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$ computing workers. Each worker is connected to a distinct subset of L numbers of APs through wireless links. The APs act as intermediate hubs, facilitating the exchange of IVs among workers over wireless channels. Each worker is assigned a subset of the input files, processes them locally to compute IVs, and then transmits some IVs to its connected APs. The APs aggregate and broadcast the received information to other workers, ensuring that all workers obtain the necessary IVs to compute their respective output functions. This multi-AP structure provides enhanced reliability and robustness in the face of AP or node failures. We are interested in the tradeoff between the communication load and computation load (defined as the average number of nodes processing each input file), and aim to improve the overall efficiency of the distributed computing system by exploiting computation resources at workers and creating additional opportunities for parallelism and multicast transmission.

In this paper, we first obtain a baseline scheme by using CPDA. Then, by novelly characterizing the scheme from the view point of linear algebra, the problem of designing a CDC scheme for combination network is equivalent to constructing a special matrix. Finally, using CPDA, we obtain an improved CDC scheme which has a lower communication load than that of the baseline scheme, for which the computation load does not increase.

Notations: We denote the set of positive integers by ${\mathbb{N}}^{+}$. For $n\in {\mathbb{N}}^{+}$, the set $\{1,\dots ,n\}$ is denoted as $\left[n\right]$, and $|.|$ is used to represent the cardinality of a set or the length of a vector. Denote $\left({\displaystyle \genfrac{}{}{0pt}{}{\left[H\right]}{L}}\right)=\left\{A\right|A\in \left[H\right],\left|A\right|=L\}$, i.e., $\left({\displaystyle \genfrac{}{}{0pt}{}{\left[H\right]}{L}}\right)$ is the collection of subsets of $\left[H\right]$ of size L.

2. System Model

We consider a $(H,L,M,N)$ distributed coded computing system for a combination network, where there are N input files $\mathcal{W}=\left\{w_n\right|n\in \left[N\right]\}$, each of which has B bits, H APs $\mathcal{H}=\{1,2,\dots ,H\}$ without storage, K workers, each of which can store at most M files, and K output functions $\mathcal{Q}=\left\{{\varphi }_q\right|q\in \left[K\right]\}$ from N files, each of which is arranged to one worker. Each worker is connected to a unique L-subset of APs over the wireless channel. So $K=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$ and the user set can be written as $\mathcal{K}=\left({\displaystyle \genfrac{}{}{0pt}{}{\left[H\right]}{L}}\right)$. Each worker is connected to the other workers via these wireless channels through common APs. For instance, Figure 1 shows a combination network with $H=4$ and $L=2$. For each $q\in \left[K\right]$, the output function ${\varphi }_q$ maps the N input files into a streams of U bits, i.e., we have ${\varphi }_q:{\mathbb{F}}_{2^B}^N\to {\mathbb{F}}_{2^U}$. The map function is defined as $g_q:{\mathbb{F}}_{2^B}\to {\mathbb{F}}_{2^T}$. For each $n\in \left[N\right]$, the map function maps the input file $w_n$ into intermediate value (IV) $v_{q,n}=g_q\left(w_n\right)\in {\mathbb{F}}_{2^T}$ of T bits. Similarly, for every $q\in \left[K\right]$, we define the reduce function as $h_q:{\mathbb{F}}_{2^T}^N\to {\mathbb{F}}_{2^U}$, which maps the N IVs into a stream of U bits. Consequently, the output function ${\varphi }_q\left(\mathcal{W}\right)$ is given by

$${\varphi }_q\left(\mathcal{W}\right)=h_q(v_{q,1},\dots ,v_{q,N})=h_q(g_q\left(w_1\right),\dots ,g_q\left(w_N\right))$$

as described in [4,18,20]. Thus, a $(H,L,M,N)$ distributed coded computing scheme for a combination network consists of the following three phases:

Figure 1.

A combination network with $H=4$, $L=2$.

•Map Phase: Each worker $k\in \mathcal{K}$ stores M files, denoted by ${\mathcal{Z}}_k$. We assume that each file is stored the same number of times. Based on its local stored files, worker $k\in \mathcal{K}$ can compute all the IVs $\left\{v_{q,n}\right|w_n\in {\mathcal{Z}}_k,q\in \left[K\right]\}$.

•Shuffle Phase: Each worker $k\in \mathcal{K}$ is assigned to compute an output function ${\varphi }_q$, where $q\in \left[K\right]$. In order to obtain all the IVs $\left\{v_{q,n}\right|n\in \left[N\right]\}$, the worker needs to request its required IVs from the other workers through their common APs. So, the communication process consists of two phases: uplink and downlink steps. Before the transmission begins, each worker encodes the IVs $v_{q,n}\in {\mathbb{F}}_{2^T}$ as ${\tilde{v}}_{q,n}\in \mathbb{C}$ using a randomized Gaussian encoding scheme. We assume that the transmission strategy is one-shot linear, i.e., each transmitted coded IV in a transmission could be decoded by any required worker and its local IVs. At each time slot s, in the uplink step, we denote the signal sent from the worker $k\in \mathcal{K}$ by $X_k\left(s\right)$ which satisfies the power constraint $\mathbb{E}\left[\right|X_i\left(s\right){|}^2]\le P$. Here, the worker can be silent, i.e., not send any data. Then, each AP $h\in \mathcal{H}$ receives the following signal:

$$\begin{array}{c}\hfill y_h\left(s\right)=\sum _{k\in \mathcal{K}}{c}_{k,h}{X}_k\left(s\right)+z_h\left(s\right),\end{array}$$ (1)

where $c_{k,h}$ and $z_h\left(s\right)$ denote the channel coefficients from worker k to AP h and the additive white Gaussian noise, respectively. We assume that $c_{k,h}$ is chosen from $\mathbb{C}$ if worker k is connected to AP h; otherwise, $c_{k,h}=0$. Additionally, $z_h\left(s\right)$ follows a normal distribution $\mathcal{N}(0,1)$ if worker k is connected to AP h; otherwise, $z_h\left(s\right)=0$.

In the downlink step, each AP $h\in \mathcal{H}$ sends the received coded signal $y_h\left(s\right)$ from its connected workers. The goal of the communication is to obtain all the IVs $v_{q,k}$ required by each worker $k\in \mathcal{K}$, who is arranged to compute the output function ${\varphi }_q$.

Specifically, each worker $k\in \mathcal{K}$ receives the following signal from its connected APs

$$\begin{array}{c}\hfill Y_k\left(s\right)=\sum _{h\in \mathcal{H}}{c}_{k,h}{y}_h\left(s\right)+z_k^{\prime }\left(s\right),\end{array}$$ (2)

where $z_k^{\prime }\left(s\right)$ is also the additive white Gaussian noise, and if h is connected to k, then $z_k^{\prime }\left(s\right)$ follows a normal distribution with $\mathcal{N}(0,1)$; otherwise, $z_k^{\prime }\left(s\right)=0$. We can omit the additive noise terms $z_h\left(s\right)$ and $z_k^{\prime }\left(s\right)$. This assumption is valid under the condition that the transmit power is sufficiently large to ensure a high signal-to-noise ratio (SNR).

•Reduce Phase: After receiving all the signals sent down by the AP, each worker $k\in \mathcal{K}$ can decode all its required IVs and compute the arranged output function ${\varphi }_q\left(\mathcal{W}\right)$.

Definition 1. 

The following two types of loads are used as criteria for evaluating the merits of a $(H,L,M,N)$ distributed coded computing scheme for combination network:

• Computation load is defined as the total number of mapped files across the K workers, normalized by N, i.e., $r\triangleq {\displaystyle \frac{{\sum }_{k=1}^K\left|{\mathcal{Z}}_k\right|}{N}}$;

• Communication load consists of the uplink load $L_u\triangleq {\displaystyle \frac{{\sum }_{h=1}^H{l}_h^u}{KNT}}$, where $l_h^u$ is the length of the message received by the AP h in the uplink phase, i.e., the total normalized number of bits received by the H APs in the uplink process, and the downlink load $L_d\triangleq {\displaystyle \frac{{\sum }_{h=1}^H{l}_h^d}{KNT}}$ where $l_h^d$ is the length of the message sent by AP h in the downlink phase, i.e., the total normalized number of bits sent by the H APs in the downlink process.

The authors in [21] introduced the CPDA to realize a coded caching scheme for a combination network. In this paper, we will use it to construct our schemes.

Definition 2 

(CPDA). For any positive integers H, N, Z and L with $L\le H$ and $Z\le N$, let $K=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$, an $N\times K$ array $\mathbf{P}={\left(p_{n,\mathcal{L}}\right)}_{n\in \left[N\right],\mathcal{L}\in \left({\displaystyle \genfrac{}{}{0pt}{}{\left[H\right]}{L}}\right)}$ over $\left[S\right]\cup \{\ast \}$ is called a $(K,N,Z,S)$ CPDA if it satisfies the following conditions:

• C1. The symbol "∗" appears Z times in each column;
• C2. Each $s\in \left[S\right]$ occurs at least once in the array;
• C3. For any two distinct entries $p_{n_1,{\mathcal{L}}_1}$ and $p_{n_2,{\mathcal{L}}_2}$ satisfying $p_{n_1,{\mathcal{L}}_1}=p_{n_2,{\mathcal{L}}_2}=s\in \left[S\right]$, then $p_{n_1,{\mathcal{L}}_2}=p_{n_2,{\mathcal{L}}_1}=\ast$;
• C4. For any $s\in \left[S\right]$, the labels of all columns containing symbol s have a nonempty intersection.

• If each integer occurs exactly g times in $\mathbf{P}$, we call it g-regular CPDA.

Let us take the following example to further illustrate the concept of CPDA.

Example 1. 

When $H=N=$ 4 and $Z=L=$ 2, let us consider the following array.

$$\begin{array}{c}\hfill \mathbf{P}=\left(\begin{array}{cccccc}12& 13& 14& 23& 24& 34\\ 1& 3& 4& \ast & \ast & \ast \\ 2& \ast & \ast & 3& 4& \ast \\ \ast & 2& \ast & 1& \ast & 4\\ \ast & \ast & 2& \ast & 1& 3\end{array}\right).\end{array}$$

Clearly each column has exactly $Z=$ 2 stars, and each integer occurs at least once in $\mathbf{P}$. So the conditions C1–2 hold. Let us consider the conditions C3–4. When $s=$ 1, we can obtain the following subarray:

$$\begin{array}{c}\hfill {\mathbf{P}}^{\left(1\right)}=\left(\begin{array}{ccc}12& 23& 24\\ 1& \ast & \ast \\ \ast & 1& \ast \\ \ast & \ast & 1\end{array}\right).\end{array}$$

Clearly, the entries

$$\begin{array}{cc}\hfill & p_{1,\{2,3\}}=p_{1,\{2,4\}}=p_{3,\{1,2\}}=p_{3,\{2,4\}}=p_{4,\{1,2\}}=p_{4,\{2,3\}}=\ast ,\hfill \\ \hfill & p_{1,\{1,2\}}=p_{3,\{2,3\}}=p_{4,\{2,4\}}=1.\hfill \end{array}$$

Therefore, the above two symbols 1 satisfy condition C3. The column labels corresponding to each integer 1 are $\{1,2\}$, $\{2,3\}$, and $\{2,4\}$. Clearly, $\{1,2\}\cap \{2,3\}\cap \{2,4\}=\left\{2\right\}\ne \varnothing$, which satisfy condition C4. Similarly, we can obtain the subarrays which only contain integers 2, 3, and 4, respectively and show that the conditions C3–4 hold. So, $\mathbf{P}$ is a $(6,4,2,4)$ CPDA.

There are many constructions of CPDAs in [21,22,23,24]. Here, we list some results which we will use in this paper as follows:

Lemma 1 

([21]). For any positive integers H, L, and t satisfying $L|H$ and $t<K^{\prime }=\left({\displaystyle \genfrac{}{}{0pt}{}{H-1}{L-1}}\right)$, there exists a $(\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right),L\left({\displaystyle \genfrac{}{}{0pt}{}{K^{\prime }}{t}}\right)$, $L\left({\displaystyle \genfrac{}{}{0pt}{}{K^{\prime }-1}{t-1}}\right)$, $H\left({\displaystyle \genfrac{}{}{0pt}{}{K^{\prime }}{t+1}}\right))$ CPDA.

Lemma 2 

([22]). For any positive integers $H,L,b,\lambda$ satisfying $0<L$, $b<H$, $\lambda <L$, $\lambda \le b$ and $L+b-2\lambda <H$, there exists a $(\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right),\left({\displaystyle \genfrac{}{}{0pt}{}{H}{b}}\right),\left({\displaystyle \genfrac{}{}{0pt}{}{H}{b}}\right)-\left({\displaystyle \genfrac{}{}{0pt}{}{L}{\lambda }}\right)\left({\displaystyle \genfrac{}{}{0pt}{}{H-L}{b-\lambda }}\right),\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L+b-2\lambda }}\right)·min\{\left({\displaystyle \genfrac{}{}{0pt}{}{H-L-b+2\lambda }{\lambda }}\right),\left({\displaystyle \genfrac{}{}{0pt}{}{L+b-2\lambda }{L-\lambda }}\right)\})$ CPDA.

3. Main Results

In this section, the baseline scheme is introduced. Then, we characterize the CDC scheme from the view point of a coefficient matrix, thereby obtaining an optimized CDC scheme for the combination network. Finally, we use CPDA to derive the required coefficient matrix, which significantly simplifies the system design and enhances its performance. In addition, we demonstrate that the proposed scheme achieves a lower transmission load than the baseline scheme.

When each output function is computed by exactly one worker, the authors in [25] showed that the CDC problem is equivalent to the coded caching problem for device-to-device (D2D) networks. In addition, the authors in [26] proposed that a coded caching scheme for a shared link can be used to generate a coded caching scheme for a D2D network. Using the same method in [26], we can generate a CDC scheme for a combination network based on the CPDA and obtain the following result.

Theorem 1 

(Baseline scheme). Given a g-$(K,N,Z,S)$ CPDA $\mathbf{P}$ with $g>1$ and $K=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$, there exists a $(H,L,M,N)$ baseline coded distributed computing scheme for a $(H,L)$-combination network, with a computation load of $r={\displaystyle \frac{KZ}{N}}$ and uplink and downlink communication loads of

$$\begin{array}{c}\hfill L_u=L_d={\displaystyle \frac{Sg}{KN(g-1)}}.\end{array}$$ (3)

Proof. 

We use the star positions in $\mathbf{P}$ to assign the files to each worker as follows. When $p_{n,k}=\ast$, worker k stores file $w_n$. So worker k stores the following files:

$${\mathcal{Z}}_k=\left\{w_n\right|n\in \left[N\right],p_{n,k}=\ast \}.$$ (4)

In the map phase, the set of IVs computed locally by worker k is

$${\mathcal{V}}_k=\left\{v_{q,n}\right|q\in \left[K\right],n\in \left[N\right],p_{n,k}=\ast \}.$$ (5)

According to Definition 1, the computation load is $r={\displaystyle \frac{{\sum }_{k=1}^K\left|{\mathcal{Z}}_k\right|}{N}}={\displaystyle \frac{KZ}{N}}$.

Recall that each worker $k\in \mathcal{K}$ is assigned to compute the output function ${\varphi }_{q_k}$. From (5), worker k contains the required IVs in $\left\{v_{q_k,n}\right|p_{n,k}=\ast ,n\in \left[N\right]\}$ and needs the other required IVs in $\left\{v_{q_k,n}\right|p_{n,k}\ne \ast ,n\in \left[N\right]\}$, each of which should be transmitted by the other workers.

Now, we will use the integers in $\mathbf{P}$ to design the transmission strategy in the shuffle phase. For each integer $s\in \left[S\right]$, we assume that s occurs exactly g times in $\mathbf{P}$. That is,

$$p_{n_1,k_1}=p_{n_2,k_2}=\dots =p_{n_g,k_g}=s.$$

Denote the set of workers associated with s as ${\mathcal{U}}_s=\{k_1,k_2,\dots ,k_g\}$ and their respective connected AP sets as

$$\mathcal{L}=\{{\mathcal{L}}_{k_1},{\mathcal{L}}_{k_2},\dots ,{\mathcal{L}}_{k_g}\}.$$

By the condition C4 of Definition 2, there exists at least one integer, say $h_s$, satisfying

$$h_s\in {\mathcal{L}}_{k_1}\cap {\mathcal{L}}_{k_2}\cap \dots \cap {\mathcal{L}}_{k_g}.$$

Recall that in the map phase, each worker can encode the IV $v_{q,n}\in {\mathcal{V}}_k$ into ${\tilde{v}}_{q,n}$ using a random Gaussian coding scheme, where ${\tilde{v}}_{q,n}$ has a size of t bits. To facilitate efficient transmission, each IV ${\tilde{v}}_{q,n}$ in $\{{\tilde{v}}_{q_{k_1},n_1},{\tilde{v}}_{q_{k_2},n_2},\dots ,{\tilde{v}}_{q_{k_g},n_g}\}$ is divided into $g-1$ equal-sized packets. That is,

$${\tilde{v}}_{q_k,n}={\left({\tilde{v}}_{q_k,n}^{\left(k_i\right)}\right)}_{k_i\in {\mathcal{U}}_s,k_i\ne k},$$ (6)

where ${\tilde{v}}_{q_k,n}^{\left(k_i\right)}$ denotes the packet of ${\tilde{v}}_{q_k,n}$ intended for worker $k_i$.

In the shuffle phase, each worker $k\in {\mathcal{U}}_s$ transmits the following encoded information of length ${\displaystyle \frac{t}{g-1}}$ bits to the AP $h_s$

$$X_k\left(s_k\right)=\sum _{p_{n_i,k_i}=s,k_i\ne k}{\tilde{v}}_{q_{k_i},n_i}^{\left(k\right)},$$ (7)

where $s_k$ represents the sub-slot within time slot s allocated to worker $k\in {\mathcal{U}}_s$ for transmitting its encoded data. Upon receiving the message $y_{h_s}\left(s_k\right)=c_{k,h_s}{X}_k\left(s_k\right)$ where the coefficient $c_{k,h_s}$ is the channel coefficient between worker k and AP $h_s$ and is chosen from $\mathbb{C}$ under the independent and identically distributed condition, the AP $h_s$ broadcasts it to all workers in ${\mathcal{U}}_s\setminus \left\{k\right\}$. Consequently, each worker $k_i\in {\mathcal{U}}_s\setminus \left\{k\right\}$ receives the message

$$Y_{k_i}\left(s_k\right)=c_{k_i,h_s}{y}_{h_s}\left(s_k\right)=c_{k_i,h_s}{c}_{k,h_s}{X}_k\left(s_k\right).$$ (8)

In the reduce phase, each worker $k\in \mathcal{K}$ needs to compute the output function ${\varphi }_{q_k}$. By Condition C3 of Definition 2 and Equation (5), each worker $k_i\in {\mathcal{U}}_s\setminus \left\{k\right\}$ already possesses all IVs in $X_k\left(s_k\right)$ except ${\tilde{v}}_{q_{k_i},n_i}^{\left(k\right)}$. Therefore, each worker $k_i\in {\mathcal{U}}_s$ can decode its desired IV ${\tilde{v}}_{q_{k_i},n_i}^{\left(k\right)}$ from $Y_{k_i}\left(s_k\right)$. After time slot s, each worker $k_i\in {\mathcal{U}}_s$ obtains the IV ${\tilde{v}}_{q_{k_i},n_i}$. After all S time slots, each worker $k\in \mathcal{K}$ obtains all the missing IVs $\{v_{q_k,n}\mid p_{n,k}\ne \ast ,n\in \left[N\right]\}$, which are required to compute the output function ${\varphi }_{q_k}$. With all the necessary IVs, each worker $k\in \mathcal{K}$ proceeds to compute ${\varphi }_{q_k}$ and completes the reduce phase.

Now, let us consider the communication load. By Definition 1, the uplink and downlink loads are

$$\begin{array}{cc}\hfill L_u=L_d& ={\displaystyle \frac{1}{KNt}}\sum _{s=1}^S{\displaystyle \frac{gt}{(g-1)}}={\displaystyle \frac{S}{KN}}{\displaystyle \frac{g}{(g-1)}}.\hfill \end{array}$$ (9)

Then, the proof is completed. □

3.1. Main Idea

In this subsection, we characterize the CDC scheme under the combination network from a matrix perspective. Our task is to compute $Q=K$ output functions, where each worker $k\in \mathcal{K}$ owns a portion of the input file denoted as ${\mathcal{Z}}_k$.

Map Phase: For each mapped file $w_n\in {\mathcal{Z}}_k$, worker k computes the IV $v_{q,n}$ for all K output functions. Consequently, the set of IVs available at worker $k\in \mathcal{K}$ is given by

$${\mathcal{V}}_k=\{v_{q,n}\mid q\in \left[K\right],w_n\in {\mathcal{Z}}_k\}.$$ (10)

The computation load in the map phase is given by $r={\displaystyle \frac{{\sum }_{k=1}^K\left|{\mathcal{Z}}_k\right|}{N}}.$

Shuffle Phase: The shuffle phase consists of two processes: (1) workers upload IVs to the AP via wireless channels, and (2) the AP broadcasts the received IVs to the connected workers. Before transmitting the information, each worker encodes the IV $v_{q,n}$ into ${\tilde{v}}_{q,n}$ using a random Gaussian coding scheme. During time slot s, a set of workers ${\mathcal{U}}_s=\{k_1,k_2,\dots ,k_g\}$ uploads IVs to AP $h_s$. Assuming that the signal sent by worker $k_i\in {\mathcal{U}}_s$ at time slot s is denoted as $X_{k_i}\left(s\right)$, the signal received by AP $h_s$ can be expressed as

$$y_{h_s}\left(s\right)={\mathbf{C}}_s{\mathbf{X}}_s=\left[\begin{array}{cccc}{c}_{k_1,h_s}& c_{k_2,h_s}& \dots & c_{k_g,h_s}\end{array}\right]\left[\begin{array}{c}{X}_{k_1}\left(s\right)\\ X_{k_2}\left(s\right)\\ ⋮\\ X_{k_g}\left(s\right)\end{array}\right],$$ (11)

where ${\mathbf{C}}_s$ is the channel coefficient matrix for time slot s, and ${\mathbf{X}}_s$ is the transmit signal vector for time slot s. To design $X_{k_i}\left(s\right)$, we define ${\alpha }_{k_i}=(a_{k_i,n_1},a_{k_i,n_2},\dots ,a_{k_i,n_g})$ as the encoding coefficients for worker $k_i$. Then,

$${\mathbf{X}}_s=\left[\begin{array}{c}{X}_{k_1}\left(s\right)\\ X_{k_2}\left(s\right)\\ ⋮\\ X_{k_g}\left(s\right)\end{array}\right]=\left[\begin{array}{c}{\alpha }_{k_1}\\ {\alpha }_{k_2}\\ ⋮\\ {\alpha }_{k_g}\end{array}\right]\left[\begin{array}{c}{\tilde{v}}_{q_{k_1},n_1}\\ {\tilde{v}}_{q_{k_2},n_2}\\ ⋮\\ {\tilde{v}}_{q_{k_g},n_g}\end{array}\right]=\left[\begin{array}{cccc}{a}_{k_1,n_1}& a_{k_1,n_2}& \dots & a_{k_1,n_g}\\ a_{k_2,n_1}& a_{k_2,n_2}& \dots & a_{k_2,n_g}\\ ⋮& ⋮& & ⋮& \\ a_{k_g,n_1}& a_{k_g,n_2}& \dots & a_{k_g,n_g}\end{array}\right]\left[\begin{array}{c}{\tilde{v}}_{q_{k_1},n_1}\\ {\tilde{v}}_{q_{k_2},n_2}\\ ⋮\\ {\tilde{v}}_{q_{k_g},n_g}\end{array}\right]={\mathbf{A}}_s{\tilde{\mathbf{V}}}_s,$$ (12)

where ${\mathbf{A}}_s$ is the coefficient matrix for time slot s, and ${\tilde{\mathbf{V}}}_s$ is the vector of encoded IVs. Thus, the message received by AP $h_s$ is

$$y_{h_s}\left(s\right)={\mathbf{C}}_s{\mathbf{A}}_s{\tilde{\mathbf{V}}}_s.$$ (13)

By designing the coefficient matrix ${\mathbf{A}}_s$, we can control the IVs uploaded by workers to AP $h_s$, completing the uplink process.

Next, we describe the downlink process. In time slot s, AP $h_s$ broadcasts the received message $y_{h_s}\left(s\right)$ to its connected workers. Each worker $k_i\in {\mathcal{U}}_s$ then receives

$$\begin{array}{c}\hfill Y_{k_i}\left(s\right)=c_{k_i,h_s}{y}_{h_s}\left(s\right).\end{array}$$ (14)

Using the IVs it already possesses, worker $k_i$ can decode the required information from $Y_{k_i}\left(s\right)$.

After S time slots, all K workers acquire the missing IVs required for the reduce function. Specifically, each worker $k\in \mathcal{K}$ obtains

$$\{v_{q,n}\mid q=q_k,n\in \left[N\right],w_n\notin {\mathcal{Z}}_k\}.$$

By combining their own IVs ${\mathcal{V}}_k$, each worker now possesses all the necessary information to compute the output function.

Since the messages in both the uplink and downlink processes are $y_{h_s}\left(s\right)$, and assuming each IV has a size of t bits, the communication load per time slot is t bits. According to Definition 1, the total uplink and downlink communication loads are $L_u=L_d={\displaystyle \frac{St}{KNt}}={\displaystyle \frac{S}{KN}}.$

Reduce Phase: After the shuffle phase, each worker $k\in \mathcal{K}$ computes the output function ${\varphi }_{q_k}$ using all the IVs they possess.

Theorem 2. 

Given an $(K,N,Z,S)$ CPDA with $K=\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)$, there exists a $(H,L,M,N)$ coded distributed computing scheme under a combination network, with a computation load of $r={\displaystyle \frac{KZ}{N}}$ and its uplink and downlink communication loads given by

$$\begin{array}{c}\hfill L_u=L_d={\displaystyle \frac{S}{KN}}.\end{array}$$ (15)

Proof. 

We use a $(K,N,Z,S)$ CPDA to design both the input file assignment and the coefficient matrix for the shuffle phase.

Before the computation task begins, the input file assigned to each worker $k\in \mathcal{K}$ is

$${\mathcal{Z}}_k=\{w_n\mid n\in \left[N\right],p_{n,k}=\ast \}.$$ (16)

In the map phase, each worker maps the input file it owns into K IVs $v_{q,n}$. Thus, the IVs at worker $k\in \mathcal{K}$ are

$${\mathcal{V}}_k=\{v_{q,n}\mid q\in \left[K\right],n\in \left[N\right],p_{n,k}=\ast \}.$$ (17)

Since each worker is allocated Z input files, the computation load according to Definition 1 is $r={\displaystyle \frac{{\sum }_{k=1}^K\left|{\mathcal{Z}}_k\right|}{N}}={\displaystyle \frac{KZ}{N}}.$

Before the shuffle phase, each worker encodes the IV $v_{q,n}$ into ${\tilde{v}}_{q,n}$ using a random Gaussian coding scheme, where ${\tilde{v}}_{q,n}$ has a size of t bits. In the shuffle phase, we consider an integer $s\in \left[S\right]$ in the CPDA $\mathbf{P}$, and suppose s occurs g times in $\mathbf{P}$. Let $p_{n_1,k_1}=p_{n_2,k_2}=\dots =p_{n_g,k_g}=s$. The set of workers involved in time slot s is ${\mathcal{U}}_s=\{k_1,k_2,\dots ,k_g\}$, and the APs connected to all workers in ${\mathcal{U}}_s$ are denoted as $I_s=\{h\mid h\in \mathcal{H},h\mathrm{is}\mathrm{connected}\mathrm{to}\mathrm{all}{k}_i\in {\mathcal{U}}_s\}$. An arbitrary AP $h_s\in I_s$ is selected to handle the uplink and downlink communication in time slot s.

In time slot s, we design the message received by AP $h_s$ as

$$y_{h_s}\left(s\right)=\sum _{i=1}^g{\tilde{v}}_{q_{k_i},n_i}=\left[\begin{array}{cccc}1& 1& \dots & 1\end{array}\right]\left[\begin{array}{c}{\tilde{v}}_{q_{k_1},n_1}\\ {\tilde{v}}_{q_{k_2},n_2}\\ ⋮\\ {\tilde{v}}_{q_{k_g},n_g}\end{array}\right].$$ (18)

Let

$${\tilde{\mathbf{V}}}_s=\left[\begin{array}{c}{\tilde{v}}_{q_{k_1},n_1}\\ {\tilde{v}}_{q_{k_2},n_2}\\ ⋮\\ {\tilde{v}}_{q_{k_g},n_g}\end{array}\right].$$

From (13) and (18), we need to design the coefficient matrix ${\mathbf{A}}_s$ such that

$$\left[\begin{array}{cccc}{c}_{k_1,h_s}& c_{k_2,h_s}& \dots & c_{k_g,h_s}\end{array}\right]{\mathbf{A}}_s=\left[\begin{array}{cccc}1& 1& \dots & 1\end{array}\right].$$ (19)

Since $p_{k_i,n_i}\ne \ast$, by (17), worker $k_i$ does not possess the IV ${\tilde{v}}_{q_{k_i},n_i}$. Thus, $a_{k_i,n_i}=0$, and (19) can be written as

$$\left[\begin{array}{cccc}{c}_{k_1,h_s}& c_{k_2,h_s}& \dots & c_{k_g,h_s}\end{array}\right]\left[\begin{array}{cccc}0& a_{k_1,n_2}& \dots & a_{k_1,n_g}\\ a_{k_2,n_1}& 0& \dots & a_{k_2,n_g}\\ ⋮& ⋮& & ⋮\\ a_{k_g,n_1}& a_{k_g,n_2}& \dots & 0\end{array}\right]=\left[\begin{array}{cccc}1& 1& \dots & 1\end{array}\right].$$ (20)

By linear algebra, i.e., given the row vector $(c_{k_1,h_s},c_{k_2,h_s},\dots ,c_{k_g,h_s})$, we can always obtain a non-zero column vector ${\mathbf{a}}_i$ of ${\mathbf{A}}_s$ such that the ith coordinate is zero. So, we can always obtain the coefficient matrix ${\mathbf{A}}_s$ in (20).

In the uplink phase, each worker $k_i\in {\mathcal{U}}_s$ transmits the encoded information $X_{k_i}\left(s\right)={\alpha }_{k_i}{\tilde{\mathbf{V}}}_s$ to AP $h_s$. In the downlink phase, AP $h_s$ broadcasts $y_{h_s}\left(s\right)$ to all workers in ${\mathcal{U}}_s$. From Condition $C3$ of Definition 2 and Equation (17), each worker $k_i\in {\mathcal{U}}_s$ already possesses all IVs in $y_{h_s}\left(s\right)$ except ${\tilde{v}}_{q_{k_i},n_i}$. Thus, each worker $k_i\in {\mathcal{U}}_s$ can decode its desired IV ${\tilde{v}}_{q_{k_i},n_i}$ from $y_{h_s}\left(s\right)$. After S time slots, all K workers obtain the missing IVs necessary for computing the reduce function.

Since the size of each IV ${\tilde{v}}_{q,n}$ is t bits, the communication load per time slot is t bits. The total uplink and downlink communication loads are

$$L_u=L_d={\displaystyle \frac{St}{KNt}}={\displaystyle \frac{S}{KN}}.$$ (21)

In the reduce phase, each worker $k\in \mathcal{K}$ computes the output function ${\varphi }_{q_k}(w_1,w_2,\dots ,w_N)$. Since ${\varphi }_{q_k}(w_1,w_2,\dots ,w_N)=h_k(v_{q_k,1},v_{q_k,2},\dots ,v_{q_k,N})$, worker k utilizes the IVs of all N files for the $q_k$-th output function. After the shuffle phase, each worker $k\in \mathcal{K}$ is given the IVs needed to compute ${\varphi }_{q_k}$. Therefore, all workers can compute their assigned output functions. □

3.2. Performance Evaluation

In this subsection, let us consider the performance of the proposed schemes by applying the CPDA in Lemmas 1 and 2 to Theorems 1 and 2, respectively. The resulting schemes are summarized in Table 1 and Table 2 respectively. In the following, let us consider the computation load and communication load of these schemes.

Table 1.

The baseline schemes in Theorem 1.

Scheme	r	${\mathit{L}}_{\mathit{u}},{\mathit{L}}_{\mathit{d}}$	Original
base scheme 1	${\displaystyle \frac{tH}{L}}$	${\displaystyle \frac{K^{\prime }-t}{t{K}^{\prime }}}$	Lemma 1
base scheme 2	$\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)-\left({\displaystyle \genfrac{}{}{0pt}{}{b}{\lambda }}\right)\left({\displaystyle \genfrac{}{}{0pt}{}{H-b}{L-\lambda }}\right)$	${\displaystyle \frac{\left(\genfrac{}{}{0pt}{}{H}{L+b-2\lambda }\right)·\left(\genfrac{}{}{0pt}{}{H-L-b+2\lambda }{\lambda }\right)\left(\genfrac{}{}{0pt}{}{L+b-2\lambda }{L-\lambda }\right)}{\left(\genfrac{}{}{0pt}{}{H}{L}\right)\left(\genfrac{}{}{0pt}{}{H}{b}\right)(max(\left(\genfrac{}{}{0pt}{}{H-L-b+2\lambda }{\lambda }\right),\left(\genfrac{}{}{0pt}{}{L+b-2\lambda }{L-\lambda }\right))-1)}}$	Lemma 2

Table 2.

The main schemes in Theorem 2.

Scheme	r	${\mathit{L}}_{\mathit{u}},{\mathit{L}}_{\mathit{d}}$	Original
main scheme 1	${\displaystyle \frac{tH}{L}}$	${\displaystyle \frac{K^{\prime }-t}{(t+1)K^{\prime }}}$	Lemma 1
main scheme 2	$\left({\displaystyle \genfrac{}{}{0pt}{}{H}{L}}\right)-\left({\displaystyle \genfrac{}{}{0pt}{}{b}{\lambda }}\right)\left({\displaystyle \genfrac{}{}{0pt}{}{H-b}{L-\lambda }}\right)$	${\displaystyle \frac{\left(\genfrac{}{}{0pt}{}{H}{L+b-2\lambda }\right)·min(\left(\genfrac{}{}{0pt}{}{H-L-b+2\lambda }{\lambda }\right),\left(\genfrac{}{}{0pt}{}{L+b-2\lambda }{L-\lambda }\right))}{\left(\genfrac{}{}{0pt}{}{H}{L}\right)\left(\genfrac{}{}{0pt}{}{H}{b}\right)}}$	Lemma 2

Figure 2 illustrates the relationship between the computation load and the communication load for the schemes in Table 1 and Table 2. Let us consider the distributed computing system with $K=15$ computing nodes and $Q=K=15$ output functions under the $(6,2)$-combination network. As shown in Figure 2, when the same class of CPDA is used, the main scheme of Theorem 2 achieves a lower communication load than the base scheme of Theorem 1 for the same computation load. This improvement results from the main scheme’s more efficient utilization of the multicast gain, which reduces the communication load.

Figure 2.

The relationship between the computation load and the communication load for the schemes in Table 1 and Table 2 is illustrated for a distributed computing system with $K=15$ computing nodes and $Q=K=15$ output functions under the $(6,2)$-combination network.

3.3. Example for Achievable Scheme

We consider a combinatorial network with $H=3$, $L=2$, where $K=3$ and $N=3$. The tasks to be computed by the 3 workers are ${\varphi }_1$, ${\varphi }_2$, and ${\varphi }_3$, respectively. The workers are denoted as $\mathcal{K}=\{12,13,23\}$, and the input files are denoted as $\mathcal{W}=\{w_1,w_2,w_3\}$. Before starting the task, the input files are assigned as follows: ${\mathcal{Z}}_{12}=\left\{w_1\right\}$ to worker 12, ${\mathcal{Z}}_{13}=\left\{w_2\right\}$ to worker 13, and ${\mathcal{Z}}_{23}=\left\{w_3\right\}$ to worker 23.

3.3.1. Map Phase

In the map phase, each worker maps each assigned file into 3 IVs. Specifically:

• Worker 12 owns ${\mathcal{V}}_{12}=\{v_{1,1},v_{2,1},v_{3,1}\}$ but lacks $\{v_{1,2},v_{1,3}\}$.

• Worker 13 owns ${\mathcal{V}}_{13}=\{v_{1,2},v_{2,2},v_{3,2}\}$ but lacks $\{v_{2,1},v_{2,3}\}$.

• Worker 23 owns ${\mathcal{V}}_{23}=\{v_{1,3},v_{2,3},v_{3,3}\}$ but lacks $\{v_{3,1},v_{3,2}\}$.

3.3.2. Shuffle Phase

After the map phase, the shuffle phase begins, where workers exchange IVs via the APs. Each worker encodes the IVs $v_{q,n}$ into ${\tilde{v}}_{q,n}$ using a randomized Gaussian coding scheme to ensure reliable transmission over the wireless channel.

• Time Slot 1: Workers 12 and 13 send $X_{12}\left(1\right)={\displaystyle \frac{1}{c_{12,1}}}{\tilde{v}}_{2,1}$ and $X_{13}\left(1\right)={\displaystyle \frac{1}{c_{13,1}}}{\tilde{v}}_{1,2}$ to AP 1 simultaneously. AP 1 receives the message $y_1\left(1\right)={\tilde{v}}_{1,2}+{\tilde{v}}_{2,1}$, completing the uplink process. AP 1 then broadcasts $y_1\left(1\right)$ to workers 12 and 13, who receive $Y_{12}\left(1\right)=c_{12,1}({\tilde{v}}_{1,2}+{\tilde{v}}_{2,1})$ and $Y_{13}\left(1\right)=c_{13,1}({\tilde{v}}_{1,2}+{\tilde{v}}_{2,1})$, respectively.

• Time Slot 2: Workers 12 and 23 send $X_{12}\left(2\right)={\displaystyle \frac{1}{c_{12,2}}}{\tilde{v}}_{3,1}$ and $X_{23}\left(2\right)={\displaystyle \frac{1}{c_{23,2}}}{\tilde{v}}_{1,3}$ to AP 2 simultaneously. After the uplink and downlink phases, workers 12 and 23 receive $Y_{12}\left(2\right)=c_{12,2}({\tilde{v}}_{1,3}+{\tilde{v}}_{3,1})$ and $Y_{23}\left(2\right)=c_{23,2}({\tilde{v}}_{1,3}+{\tilde{v}}_{3,1})$, respectively.

• Time Slot 3: Workers 13 and 23 send $X_{13}\left(3\right)={\displaystyle \frac{1}{c_{13,3}}}{\tilde{v}}_{3,2}$ and $X_{23}\left(3\right)={\displaystyle \frac{1}{c_{23,3}}}{\tilde{v}}_{2,3}$ to AP 3 simultaneously. After the uplink and downlink phases, workers 13 and 23 receive $Y_{13}\left(3\right)=c_{13,3}({\tilde{v}}_{2,3}+{\tilde{v}}_{3,2})$ and $Y_{23}\left(3\right)=c_{23,3}({\tilde{v}}_{2,3}+{\tilde{v}}_{3,2})$, respectively.

3.3.3. Reduce Phase

In the reduce phase, each worker decodes the missing IVs:

• Worker 12 solves ${\tilde{v}}_{1,2}$ and ${\tilde{v}}_{1,3}$ from $Y_{12}\left(1\right)$ and $Y_{12}\left(2\right)$ using its own ${\tilde{v}}_{2,1}$ and ${\tilde{v}}_{3,1}$.

• Worker 13 solves ${\tilde{v}}_{2,1}$ and ${\tilde{v}}_{2,3}$ from $Y_{13}\left(1\right)$ and $Y_{13}\left(3\right)$ using its own ${\tilde{v}}_{1,2}$ and ${\tilde{v}}_{3,2}$.

• Worker 23 solves ${\tilde{v}}_{3,1}$ and ${\tilde{v}}_{3,2}$ from $Y_{23}\left(2\right)$ and $Y_{23}\left(3\right)$ using its own ${\tilde{v}}_{1,3}$ and ${\tilde{v}}_{2,3}$.

After obtaining all the required IVs, each worker computes its assigned output function.

In this example, the computation load is $r={\displaystyle \frac{1+1+1}{3}}=1$. Assuming each IV ${\tilde{v}}_{q,n}$ has a size of t bits, the uplink and downlink loads are calculated as $L_u=L_d={\displaystyle \frac{3t}{3\times 3t}}={\displaystyle \frac{1}{3}}$.

4. Conclusions

In this paper, we studied the coded distributed computing for $(H,L)$-combination networks and provided a comprehensive framework for constructing CDC scheme from the view point of linear algebra. Then, by using CPDAs, we proposed two classes of CDC schemes for the combination network. Finally by comparisons, we showed that the proposed schemes have lower communication loads than the baseline schemes.

Author Contributions

Conceptualization, Y.Y. and X.Q.; Methodology, Y.H.; Software, Y.Y. and S.L.; Formal analysis, X.Q.; Resources, S.L.; Data curation, Y.H. and S.L.; Writing—original draft, Y.Y.; Writing—review & editing, X.Q. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data are available upon request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Funding Statement

This research was funded by the Key Lab of Education Blockchain and Intelligent Technology, Ministry of Education (EBME24-15).