Systematic Extraction and Implementation of Divide-and-Conquer Parallelism

Systematic Extraction and Implementation of Divide-and-Conquer Parallelism (1996)

Cached

Download Links

[ftp.uni-passau.de]
[wwwmath.uni-muenster.de]

Other Repositories/Bibliography

DBLP

by Sergei Gorlatch

Venue:	Programming languages: Implementation, Logics and Programs, Lecture Notes in Computer Science 1140
Citations:	15 - 5 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Systematic extraction and implementation of divide-and-conquer parallelism	INFERENCE
AUTHOR NAME	Sergei Gorlatch	SVM HeaderParse 0.1
AUTHOR ADDR	University of Passau, D--94030 Passau, Germany	SVM HeaderParse 0.1
ABSTRACT	Homomorphisms are functions that match the divide-and-conquer paradigm and thus can be computed in parallel. Two problems are studied for homomorphisms on lists: (1) parallelism extraction: finding a homomorphic representation of a given function; (2) parallelism implementation: deriving an efficient parallel program that computes the function. A systematic approach to parallelism extraction proceeds by generalization of two sequential representations based on traditional cons lists and dual snoc lists. For some non-homomorphic functions, e.g., the maximum segment sum problem, our method provides an embedding into a homomorphism. The implementation is addressed by introducing a subclass of distributable homomorphisms and deriving for them a parallel program schema, which is time optimal on the hypercube architecture. The derivation is based on equational reasoning in the Bird-Meertens formalism, which guarantees the correctness of the parallel target program. The approach is illustrated with function...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	Programming languages: Implementation, Logics and Programs, Lecture Notes in Computer Science 1140	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	274--288	INFERENCE
VOLUME	41	INFERENCE
CITATIONS	10 found	ParsCit 1.0