CoChat

A Scalable Framework for Wireless Distributed Computing

Open access
Li, Songze, Yu, Qian, Maddah-Ali, Mohammad Ali, Avestimehr, A. Salman · 2017 · IEEE/ACM Transactions on Networking
Cited by 130

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnet.2017.2702605

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 32

  1. 10.1109/CLUSTER.2011.80 · doi:10.1109/cluster.2011.80
  2. 10.1109/TIT.2010.2103753 · DOI · Paper page
  3. 10.1109/TIT.2006.874540 · DOI · Paper page
  4. 10.1002/ett.1399 · DOI
  5. 10.1109/ALLERTON.2016.7852225 · DOI
  6. 10.1145/2723372.2742790 · DOI · Paper page
  7. zaharia, 2008, Improving MapReduce performance in heterogeneous environments, Proc OSDI, 8, 7
  8. 10.1109/ISIT.2016.7541612 · DOI
  9. 10.1109/IPDPSW.2017.33 · DOI
  10. dean, 2004, MapReduce: Simplified data processing on large clusters, Proc 6th USENIX (OSDI), 10
  11. zaharia, 2010, Spark: Cluster computing with working sets, Proc 2nd USENIX Conf HotCloud, 10
  12. 10.1109/TNET.2014.2317316 · DOI · Paper page
  13. 10.1109/TIT.2015.2504556 · DOI · Paper page
  14. 10.1109/ISIT.2014.6875212 · DOI
  15. reisizadehmobarakeh, 0, Coded computation over heterogeneous clusters, Proc IEEE ISIT
  16. 10.1109/ISIT.2003.1228459 · doi:10.1109/isit.2003.1228459
  17. 10.1109/UIC-ATC.2013.94 · DOI · Paper page
  18. 10.1109/TNET.2003.818197 · DOI · Paper page
  19. 10.1145/1810931.1810937 · DOI · Paper page
  20. 10.1109/TIT.2008.929913 · DOI
  21. 10.1109/ALLERTON.2015.7447112 · DOI
  22. 10.1145/2043164.2018448 · DOI · Paper page
  23. 10.1109/GLOCOM.2016.7841765 · DOI
  24. 10.1109/ISIT.2016.7541612 · DOI
  25. 10.1109/SEC.2016.11 · DOI
  26. 10.1109/GLOCOMW.2016.7848828 · DOI · Paper page
  27. 10.1002/ett.3028 · DOI
  28. 10.1109/MSP.2014.2334709 · DOI · Paper page
  29. 10.1109/ISIT.2017.8007057 · DOI
  30. 10.1109/MCOM.2017.1600894 · DOI · Paper page
  31. 10.1109/18.850663 · DOI · Paper page
  32. 10.1017/CBO9781139058452 · DOI · Paper page

Cited by

See all 130

Metadata

Authors
Li, S., Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S.
Venue
IEEE/ACM Transactions on Networking
Published
2017-10
Volume
25
Issue
5
Pages
2643-2654
ISSN
  • 1063-6692 (ISSN-L)
  • 1558-2566
OpenAlex
W2962825369
Cited by
130
References
4
FWCI
9.17
Type
journal article
Language
en
Open access
green
Funders
  • NSF (CCF-1408639, NETS-1419632)
  • ONR (N000141612189)
  • National Security Agency (NSA) (H98230-16-C-0255)
  • Intel under a research gift
  • Defense Advanced Research Projects Agency (HR001117C0053)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.