  Coded distributed computing can alleviate the communication load by
leveraging the redundant storage and computation resources with coding
techniques in distributed computing. In this paper, we study a MapReduce-type
distributed computing framework over star topological network, where all the
workers exchange information through a common access point. The optimal
tradeoff among the normalized number of the stored files (storage load),
computed intermediate values (computation load) and transmitted bits in the
uplink and downlink (communication loads) are characterized. A coded computing
scheme is proposed to achieve the Pareto-optimal tradeoff surface, in which the
access point only needs to perform simple chain coding between the signals it
receives, and information-theretical bound matching the surface is also
provided.
