Coded TeraSort
Songze Li, Sucha Supittayapornpong, Mohammad Ali Maddah-Ali, Salman Avestimehr · 2017
We focus on sorting, which is the building block of many machine learning algorithms, and propose a novel distributed sorting algorithm, named CodedTeraSort, which substantially improves the execution time of the TeraSort benchmark in Hadoop MapReduce. The key idea of CodedTeraSort 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.97× - 3.39× speedup, compared with TeraSort, for typical settings of interest.