Distributed Computing with Heterogeneous Communication Constraints: The Worst-Case Computation Load and Proof by Contradiction

02/01/2018
by   Nishant Shakya, et al.
0

We consider a distributed computing framework where the distributed nodes have different communication capabilities, motivated by the heterogeneous networks in data centers and mobile edge computing systems. Following the structure of MapReduce, this framework consists of Map computation phase, Shuffle phase, and Reduce computation phase. The Shuffle phase allows distributed nodes to exchange intermediate values, in the presence of heterogeneous communication bottlenecks for different nodes (heterogeneous communication load constraints). Focusing on two-node and three-node (K=2, 3) distributed computing systems with heterogeneous communication load constraints, in this work we characterize the minimum total computation load, as well as the minimum worst-case computation load for some cases. The worst-case computation load depends on the computation load of a node with the heaviest job. Therefore, by minimizing the worst-case computation load it could potentially minimize the system latency. We show an interesting insight that, for some cases, there is a tradeoff between the minimum total computation load and the minimum worst-case computation load, in the sense that both cannot be achieved at the same time. The achievability schemes are proposed with careful design on the file assignment and data shuffling. Finally, beyond the cut-set bound, a novel converse is proposed using the proof by contradiction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2018

Wireless MapReduce Distributed Computing

Motivated by mobile edge computing and wireless data centers, we study a...
research
02/27/2019

Coded Distributed Computing with Heterogeneous Function Assignments

Coded distributed computing (CDC) introduced by Li et. al. is an effecti...
research
08/19/2019

Heterogeneous Coded Distributed Computing: Joint Design of File Allocation and Function Assignment

This paper studies the computation-communication tradeoff in a heterogen...
research
01/17/2022

Universal Coded Distributed Computing For MapReduce Frameworks

Coded distributed computing (CDC) can trade extra computing power to red...
research
08/20/2021

Federated Distributionally Robust Optimization for Phase Configuration of RISs

In this article, we study the problem of robust reconfigurable intellige...
research
01/22/2019

CAMR: Coded Aggregated MapReduce

Many big data algorithms executed on MapReduce-like systems have a shuff...
research
05/21/2020

Distributed Verifiers in PCP

Traditional proof systems involve a resource-bounded verifier communicat...

Please sign up or login with your details

Forgot password? Click here to reset