Versatile Communication Algorithms for Data Analysis

Abstract

Large-scale parallel data analysis, where global information from a variety of problem domains is resolved in a distributed memory space, relies on communication. Three communication algorithms motivated by data analysis workloads—merge based reduction, swap based reduction, and neighborhood exchange—are presented, and their performance is benchmarked. These algorithms communicate custom data types among blocks assigned to processes in flexible ways, and their performance is optimized by tunable parameters. Performance is compared with an MPI implementation and with previous communication algorithms on an IBM Blue Gene/P supercomputer at a variety of message sizes and process counts.

DOI: 10.1007/978-3-642-33518-1_33

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@inproceedings{Peterka2012VersatileCA, title={Versatile Communication Algorithms for Data Analysis}, author={Tom Peterka and Robert B. Ross}, booktitle={EuroMPI}, year={2012} }