K-Balanced sorting and skew join in MPI and MapReduce
Refereed conference paper presented and published in conference proceedings

Times Cited
Altmetrics Information

Other information
AbstractWe consider algorithms for sorting and skew equi-join operations for computer clusters. The proposed algorithms achieve the best known theoretical workload balancing guarantee, and exhibit close to optimal balancing in our experiments. Our empirical studies also show that the proposed sorting algorithm is up to 30% faster than the state-of-the-art algorithm.
All Author(s) ListHuang S., Fu A.W.-C.
Name of Conference2nd IEEE International Conference on Big Data, IEEE Big Data 2014
Start Date of Conference27/10/2014
End Date of Conference30/10/2014
Place of ConferenceWashington
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by IEEE,
Pages225 - 230
LanguagesEnglish-United Kingdom

Last updated on 2020-23-05 at 00:18