Wireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI

Consider a distributed computing system in which the worker nodes are connected over a shared wireless channel. Nodes can store a fraction of the data set over which computation needs to be carried out, and a Map-Shuffle-Reduce protocol is followed in order to enable collaborative processing. If there exists some level of redundancy among the computations performed at the nodes, the inter-node communication load during the Shuffle phase can be reduced by using either coded multicasting or cooperative transmission. It was previously shown that the latter approach is able to reduce the high-Signal-to-Noise Ratio communication load by half in the presence of full-duplex nodes and perfect transmit-side Channel State Information (CSI). In this paper, a novel scheme based on superposition coding is proposed that is demonstrated to outperform both coded multicasting and cooperative transmission under the assumption of imperfect CSI.

[1]  A. Salman Avestimehr,et al.  A Scalable Framework for Wireless Distributed Computing , 2016, IEEE/ACM Transactions on Networking.

[2]  A. Salman Avestimehr,et al.  A Fundamental Tradeoff Between Computation and Communication in Distributed Computing , 2016, IEEE Transactions on Information Theory.

[3]  Osvaldo Simeone,et al.  Improved Latency-communication Trade-off for Map-shuffle-reduce Systems with Stragglers , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  Mohammad Ali Maddah-Ali,et al.  Coding for Distributed Fog Computing , 2017, IEEE Communications Magazine.

[5]  Kannan Ramchandran,et al.  Speeding Up Distributed Machine Learning Using Codes , 2015, IEEE Transactions on Information Theory.

[6]  Sheng Yang,et al.  A Storage-Computation-Communication Tradeoff for Distributed Computing , 2018, 2018 15th International Symposium on Wireless Communication Systems (ISWCS).

[7]  Osvaldo Simeone,et al.  Cloud-Edge Non-Orthogonal Transmission for Fog Networks with Delayed CSI at the Cloud , 2018, 2018 IEEE Information Theory Workshop (ITW).

[8]  Deniz Gündüz,et al.  Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[9]  Bruno Clerckx,et al.  Sum-Rate Maximization for Linearly Precoded Downlink Multiuser MISO Systems With Partial CSIT: A Rate-Splitting Approach , 2016, IEEE Transactions on Communications.

[10]  Osvaldo Simeone,et al.  Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs , 2016, IEEE Transactions on Information Theory.

[11]  Petros Elia,et al.  Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[12]  John Langford,et al.  Scaling up machine learning: parallel and distributed approaches , 2011, KDD '11 Tutorials.

[13]  Zhi Ding,et al.  Data Shuffling in Wireless Distributed Computing via Low-Rank Optimization , 2018, IEEE Transactions on Signal Processing.

[14]  Paul de Kerret,et al.  On the degrees of freedom of the K-user time correlated broadcast channel with delayed CSIT , 2013, 2013 IEEE International Symposium on Information Theory.

[15]  Fan Li,et al.  Wireless MapReduce Distributed Computing , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).