Systematic Efficient Parallelization of Scan and Other List Homomorphisms

Systematic Efficient Parallelization of Scan and Other List Homomorphisms (1996)

by Sergei Gorlatch

Venue:	In Annual European Conference on Parallel Processing, LNCS 1124
Citations:	25 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Systematic Efficient Parallelization of Scan and Other List Homomorphisms	user correction - Legacy Corrections
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 which can be parallelized by the divide-and-conquer paradigm. A class of distributable homomorphisms (DH) is introduced and an efficient parallel implementation schema for all functions of the class is derived by transformations in the Bird-Meertens formalism. The schema can be directly mapped on the hypercube with an unlimited or an arbitrary fixed number of processors, providing provable correctness and predictable performance. The popular scan-function (parallel prefix) illustrates the presentation: the systematically derived implementation for scan coincides with the practically used "folklore" algorithm for distributed-memory machines.	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	In Annual European Conference on Parallel Processing, LNCS 1124	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	401--408	INFERENCE
CITATIONS	13 found	ParsCit 1.0