{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:27:51Z","timestamp":1747056471485,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8635882","type":"proceedings-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T03:04:31Z","timestamp":1551409471000},"page":"662-669","source":"Crossref","is-referenced-by-count":10,"title":["Fundamental Limits of Distributed Data Shuffling"],"prefix":"10.1109","author":[{"given":"Kai","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Tuninetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyue","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Piantanida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852338"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841903"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref6","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"Proc IEEE Inform Theory Workshop"},{"key":"ref11","article-title":"A fundamental tradeoff between computation and communication in distributed computing","volume":"pp","author":"li","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref8","article-title":"Near optimal coded data shuffling for distributed learning","author":"attia","year":"2018","journal-title":"arXiv 1801 01875"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006802"},{"key":"ref2","article-title":"Ubershuffle: Communication-efficient data shuffling for sgd via coding theory","author":"chung","year":"0","journal-title":"NIPS 2017 ML Systems Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437672"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2018,10,2]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08635882.pdf?arnumber=8635882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T23:07:07Z","timestamp":1598224027000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8635882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8635882","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}