{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:56:25Z","timestamp":1772909785209,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437669","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1630-1634","source":"Crossref","is-referenced-by-count":68,"title":["Hierarchical Coding for Distributed Computing"],"prefix":"10.1109","author":[{"given":"Hyegyeong","family":"Park","sequence":"first","affiliation":[]},{"given":"Kangwook","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jy-Yong","family":"Sohn","sequence":"additional","affiliation":[]},{"given":"Changho","family":"Suh","sequence":"additional","affiliation":[]},{"given":"Jaekyun","family":"Moon","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref11","first-page":"2100","article-title":"Short-Dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc NIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref14","first-page":"1","article-title":"ShuffleWatcher: Shuffle-aware scheduling in multi-tenant MapReduce clusters","author":"ahmad","year":"2014","journal-title":"Proc USENIX ATC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.72"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277996"},{"key":"ref17","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"Proc USENIX HotStorage"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","author":"david","year":"2003","journal-title":"Order Statistics"},{"key":"ref19","author":"park","year":"2018","journal-title":"Hierarchical coding for distributed computing"},{"key":"ref4","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc NIPS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","author":"halbawi","year":"2017","journal-title":"Improving distributed gradient descent using Reed-Solomon codes"},{"key":"ref5","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc ICML"},{"key":"ref8","author":"charles","year":"2017","journal-title":"Approximate Gradient Coding via Sparse Random Graphs"},{"key":"ref7","author":"raviv","year":"2017","journal-title":"Gradient coding from cyclic MDS codes and expander graphs"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref1","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc NIPS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref20","volume":"31","author":"bremaud","year":"2013","journal-title":"Markov Chains Gibbs Fields Monte Carlo Simulation and Queues"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541436"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref23","first-page":"409","article-title":"Balanced Reed-Solomon codes for all parameters","year":"2016","journal-title":"Proc IEEE ITW"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437669.pdf?arnumber=8437669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T23:58:00Z","timestamp":1598227080000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437669","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}