LAUSR

Although distributed computing is an efficient solution to large-scale computational tasks, its performance is determined by the slowest computing nodes, i.e., the computation stragglers among distributed nodes. To mitigate their impact, coded computation has emerged as a promising technique by introducing clever computational redundancy. Most existing works only considered the computation latency, however, transmission latency is a serious concern in wireless computing networks. In such a case, the performance is straggled by not only local computation but also wireless transmission. In this letter, we consider the wireless distributed computing network where nodes have different transmission rates and different computation capabilities. Unlike computation stragglers always existing, we derive a straggling factor for each node to indicate whether the network is straggled by transmission. To deal with both stragglers, the wireless coded computation (WCC) algorithm is proposed, which generalizes existing methods. By comparing WCC with four benchmark schemes, Uniform Uncoded Allocation, Non-Uniform Uncoded Allocation, Uniform Coded Allocation, and Heterogeneous Coded Matrix Multiplication, it shows that WCC results in significant speedups of up to 72%, 66%, 64% and 47% over the four aforementioned benchmark schemes, respectively.