Journal
IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 25, Issue 5, Pages 2643-2654Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2017.2702605
Keywords
Wireless distributed computing; edge computing; coding; information theory; scalability
Categories
Funding
- NSF [CCF-1408639, NETS-1419632]
- ONR [N000141612189]
- National Security Agency (NSA) [H98230-16-C-0255]
- Intel
- Defense Advanced Research Projects Agency [HR001117C0053]
Ask authors/readers for more resources
We consider a wireless distributed computing system, in which multiple mobile users, connected wirelessly through an access point, collaborate to perform a computation task. In particular, users communicate with each other via the access point to exchange their locally computed intermediate computation results, which is known as data shuffling. We propose a scalable framework for this system, in which the required communication bandwidth for data shuffling does not increase with the number of users in the network. The key idea is to utilize a particular repetitive pattern of placing the data set ( thus a particular repetitive pattern of intermediate computations), in order to provide the coding opportunities at both the users and the access point, which reduce the required uplink communication bandwidth from users to the access point and the downlink communication bandwidth from access point to users by factors that grow linearly with the number of users. We also demonstrate that the proposed data set placement and coded shuffling schemes are optimal (i.e., achieve the minimum required shuffling load) for both a centralized setting and a decentralized setting, by developing tight information-theoretic lower bounds.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available