Efficient Parallel Tree Reductions on Distributed Memory Environments

Authors:
Kazuhiko Kakehi;Kiminori Matsuzaki;Kento Emoto
Affiliations:
Division of University Corporate Relations,;Department of Mathematical Informatics,;Department of Creative Informatics, University of Tokyo,
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Year:
2007

Citing 9
Cited 1

A bridging model for parallel computation

Communications of the ACM
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

Journal of Algorithms
Optimal routing of parentheses on the hypercube

Journal of Parallel and Distributed Computing
All Nearest Smaller Values on the Hypercube

IEEE Transactions on Parallel and Distributed Systems
Parallel implementation of tree skeletons

Journal of Parallel and Distributed Computing
Communication efficient BSP algorithm for all nearest smaller values problem

Journal of Parallel and Distributed Computing
Efficient EREW PRAM Algorithms for Parentheses-Matching

IEEE Transactions on Parallel and Distributed Systems
The XML web: a first study

WWW '03 Proceedings of the 12th international conference on World Wide Web
A library of constructive skeletons for sequential style of parallel programming

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems

Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism

Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implementation regardless of the shapes of inputs. The prototype implementation supports its real efficacy.