Quartile and Outlier Detection on Heterogeneous Clusters Using Distributed Radix Sort
Future Technologies Group, Oak Ridge National Laboratory, 1 Bethel Valley Road, Oak Ridge, Tennessee
IEEE International Conference on Cluster Computing (CLUSTER), 2011
@inproceedings{spafford2011quartile,
title={Quartile and Outlier Detection on Heterogeneous Clusters using Distributed Radix Sort},
author={Spafford, K.L. and Meredith, J.S. and Vetter, J.S.},
booktitle={Cluster Computing (CLUSTER), 2011 IEEE International Conference on},
pages={412–419},
year={2011},
organization={IEEE}
}
In the past few years, performance improvements in CPUs and memory technologies have outpaced those of storage systems. When extrapolated to the exascale, this trend places strict limits on the amount of data that can be written to disk for full analysis, resulting in an increased reliance on characterizing in-memory data. Many of these characterizations are simple, but require sorted data. This paper explores an example of this type of characterization — the identification of quartiles and statistical outliers — and presents a performance analysis of a distributed heterogeneous radix sort as well as an assessment of current architectural bottlenecks.
December 17, 2011 by hgpu
