Coded TeraSort
From MaRDI portal
Publication:6283250
arXiv1702.04850MaRDI QIDQ6283250FDOQ6283250
Authors: Songze Li, Sucha Supittayapornpong, Mohammad Ali Maddah-Ali, A. Salman Avestimehr 
Publication date: 15 February 2017
Abstract: We focus on sorting, which is the building block of many machine learning algorithms, and propose a novel distributed sorting algorithm, named Coded TeraSort, which substantially improves the execution time of the TeraSort benchmark in Hadoop MapReduce. The key idea of Coded TeraSort is to impose structured redundancy in data, in order to enable in-network coding opportunities that overcome the data shuffling bottleneck of TeraSort. We empirically evaluate the performance of CodedTeraSort algorithm on Amazon EC2 clusters, and demonstrate that it achieves 1.97x - 3.39x speedup, compared with TeraSort, for typical settings of interest.
Has companion code repository: https://github.com/AvestimehrResearchGroup/Coded-TeraSort
This page was built for publication: Coded TeraSort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283250)
