2010 39th International Conference on Parallel Processing (2010)
San Diego, CA, USA
Sept. 13, 2010 to Sept. 16, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2010.42
The emergence of cloud computing and Google's MapReduce paradigm is renewing interest in the development of broadly applicable high level abstractions as a means to deliver easy programmability and cyber resources to the user, while hiding complexities of system architecture, parallelism and algorithms, heterogeneity, and fault-tolerance. In this paper, we present a high-level framework for computations on tree structures. Despite the diversity and types of tree structures, and the algorithmic ways in which they are utilized, our abstraction provides sufficient generality to be broadly applicable. We show how certain frequently used operations on tree structures can be cast in terms of our framework. We further demonstrate the applicability of our framework by solving two applications -- k-nearest neighbors and fast multipole method (FMM) based simulations -- by merely using our framework in multiple ways. We developed a generic programming based implementation of the framework using C++ and MPI, and demonstrate its performance on the aforementioned applications using homogeneous multi-core clusters.
A. Sarje and S. Aluru, "A MapReduce Style Framework for Computations on Trees," 2010 39th International Conference on Parallel Processing(ICPP), San Diego, CA, USA, 2010, pp. 343-352.