Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity

Distributed computing has become one of the most important frameworks in dealing with large computation tasks. In this paper, we propose a systematic construction of coded computing schemes for MapReduce-type distributed systems. The construction builds upon placement delivery arrays (PDA), originally proposed by Yan
et al.
for coded caching schemes. The main contributions of our work are three-fold. First, we identify a class of PDAs, called
Comp-PDAs
, and show how to obtain a coded computing scheme from any Comp-PDA. We also characterize the normalized number of stored files (
storage load
), computed intermediate values (
computation load
), and communicated bits (
communication load
), of the obtained schemes in terms of the Comp-PDA parameters. Then, we show that the performance achieved by Comp-PDAs describing Maddah-Ali and Niesen’s coded caching schemes matches a new information-theoretic converse, thus establishing the fundamental region of all achievable performance triples. In particular, we characterize
all
the Comp-PDAs achieving the pareto-optimal storage, computation, and communication (SCC) loads of the fundamental region. Finally, we investigate the file complexity of the proposed schemes, i.e., the smallest number of files required for implementation. In particular, we describe Comp-PDAs that achieve pareto-optimal SCC triples with significantly lower file complexity than the originally proposed Comp-PDAs.