Parallel Implementation of Tree Skeletons

Parallel Implementation of Tree Skeletons (1995)

Cached

Download Links

[ftp.qucis.queensu.ca]
[www.qucis.queensu.ca]

Other Repositories/Bibliography

DBLP

by D. B. Skillicorn

Venue:	Journal of Parallel and Distributed Computing
Citations:	18 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Parallel Implementation of Tree Skeletons	user correction - Legacy Corrections
AUTHOR NAME	D. B. Skillicorn	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computing and Information Science; Queen's University; Kingston	SVM HeaderParse 0.2
AUTHOR ADDR	Ontario K7L 3N6	SVM HeaderParse 0.1
ABSTRACT	Trees are a useful data type, but they are not routinely included in parallel programming systems because their irregular structure makes them seem hard to compute with efficiently. We present a method for constructing implementations of skeletons, high-level homomorphic operations on trees, that execute in parallel. In particular, we consider the case where the size of the tree is much larger than the the number of processors available, so that tree data must be partitioned. The approach uses the theory of categorical data types to derive implementation templates based on tree contraction. Many useful tree operations can be computed in time logarithmic in the size of their argument, on a wide range of parallel systems. 1 Contribution One common approach to general-purpose parallel computation is based on packaging complex operations as templates, or skeletons [3, 12]. Skeletons encapsulate the control and data flow necessary to compute useful operations. This permits software to be...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	Journal of Parallel and Distributed Computing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	115--125	INFERENCE
VOLUME	39	INFERENCE
CITATIONS	13 found	ParsCit 1.0