In a distributed computing system operating according to the map-shuffle-reduce framework, coding data prior to storage can be useful both to reduce the latency caused by straggling servers and to decrease the inter-server communication load in the shuffle phase. In prior work, a concatenated coding scheme was proposed for a matrix multiplication task. In this scheme, the outer Maximum Distance Separable (MDS) code is leveraged to correct erasures caused by stragglers, while the inner repetition code is used to improve the communication efficiency in the shuffle phase by means of coded multi-casting. In this work, it is demonstrated that it is possible to leverage the redundancy created by repetition coding in order to increase the rate of the outer MDS code and hence to increase the multicasting opportunities in the shuffle phase. As a result, the proposed approach is shown to improve over the best known latency-communication overhead trade-off.
|Title of host publication
|2019 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Proceedings
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - May 2019
|44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Brighton, United Kingdom
Duration: May 12 2019 → May 17 2019
|ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
|44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019
|5/12/19 → 5/17/19
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
- Distributed computing
- coded multicasting