A Pliable Index Coding Approach to Data Shuffling

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

15 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers, Inc.
Pages2558-2562
ISBN (electronic)9781509040964
Publication statusPublished - Jun 2017
Externally publishedYes

Publication series

NameIEEE International Symposium on Information Theory
ISSN (Print)2157-8095
ISSN (electronic)2157-8117

Conference

Title2017 IEEE International Symposium on Information Theory (ISIT 2017)
LocationEurogress Aachen
PlaceGermany
CityAachen
Period25 - 30 June 2017

Abstract

A promising area that has recently emerged, is on how to use index coding to improve the communication efficiency in distributed computing systems, especially for data shuffling in iterative computations. In this paper, we posit that pliable index coding can offer a more efficient framework for data shuffling, as it can better leverage the many possible shuffling choices to reduce the number of transmissions. We theoretically analyze pliable index coding under data shuffling constraints, and design an hierarchical data-shuffling scheme that uses pliable index coding as a component. We find transmission benefits up to O(ns/m) over index coding, where ns/m is the average number of workers caching a message, and m, n, and s are the numbers of messages, workers, and cache size, respectively.

Citation Format(s)

A Pliable Index Coding Approach to Data Shuffling. / Song, Linqi; Fragouli, Christina; Zhao, Tianchu.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers, Inc., 2017. p. 2558-2562 8006991 (IEEE International Symposium on Information Theory).

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review