Year: 2021
Type: article
Abstract: This paper formulates a distributed computation problem, where a master asks${\mathsf N}$distributed workers to compute a linearly separable function. The task function can be expressed as${\mathsf K}_{\mathrm{ c}}$linear combinations of${\mathsf K}$messages, where each message is a function of one dataset. Our objective is to find the optimal tradeoff between the computation cost (number of uncoded datasets assigned to each worker) and the communication cost (number of symbols the master must download), such that from the answers of any${\mathsf N}_{\mathrm{ r}}$out of${\mathsf N}$workers the master can recover the task function with high probability, where the coefficients of the${\mathsf K}_{\mathrm{ c}}$linear combinations are uniformly i.i.d. over some large enough finite field. The formulated problem can be seen as a generalized version of some existing problems, such as distributed gradient coding and distributed linear transform. In this paper, we consider the specific case where the computation cost is minimum, and propose novel achievability schemes and converse bounds for the optimal communication cost. Achievability and converse bounds coincide for some system parameters; when they do not match, we prove that the achievable distributed computing scheme is optimal under the constraint of a widely used ‘cyclic assignment’ scheme on the datasets. Our results also show that when${\mathsf K}= {\mathsf N}$, with the same communication cost as the optimal distributed gradient coding scheme proposed by Tandonet al. from which the master recovers one linear combination of${\mathsf K}$messages, our proposed scheme can let the master recover any additional${\mathsf N}_{\mathrm{ r}}-1$independent linear combinations of messages with high probability.
Authors: Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: CAREER: Fundamental Limits of Cryptographic Primitives Through Network Information Theory, SpecEES: Dynamic Space Frequency Multiplexing - A New Paradigm for Filterbank Multicarrier Spectrum Access, Collaborative Research: CIF: Small: Communication, Storage, Complexity, and Security: A Holistic View on the Fundamental Limits and Code Designs for Private Information Retrieval, G4973578154, CIF: Small: Fundamental Limits of Caching Networks with General Topologies
OpenAlex ID: W3040094851
