Efficient Implementation of Tree Accumulations on Distributed-Memory Parallel Computers

Authors:
Kiminori Matsuzaki
Affiliations:
Graduate School of Information Science and Technology, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Year:
2007

Citing 7
Cited 3

A simple parallel tree contraction algorithm

Journal of Algorithms
Efficient parallel algorithms for tree accumulations

Science of Computer Programming
A no-busy-wait balanced tree parallel algorithmic paradigm

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Synthesis of Parallel Algorithms

Synthesis of Parallel Algorithms
Introduction to Algorithms

Introduction to Algorithms
A library of constructive skeletons for sequential style of parallel programming

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Parallel tree contraction and its application

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Lessons from implementing the biCGStab method with SkeTo library

Proceedings of the fourth international workshop on High-level parallel programming and applications
Implementing fusion-equipped parallel skeletons by expression templates

IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
Balanced trees inhabiting functional parallel programming

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop an efficient implementation of two tree accumulations. In this implementation, we divide a binary tree based on the idea of m-bridges to obtain high locality, and represent local segments as serialized arrays to obtain high sequential performance. We furthermore develop a cost model for our implementation. The experiment results show good performance.