Massive parallelization of divide-and-conquer algorithms over powerlists

Massive parallelization of divide-and-conquer algorithms over powerlists

We present transformation rules to parallelize divide-and-conquer (DC) algorithms over powerlists. These rules convert the parallel control structure of DC into a sequential control flow, thereby making the implicit massive data parallelism in a DC scheme explicit. The results given here are illustr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science of computer programming 1996, Vol.26 (1), p.59-78
Hauptverfasser: Achatz, Klaus, Schulte, Wolfram
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Computer systems performance. Reliability
Exact sciences and technology
Programming theory
Software
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present transformation rules to parallelize divide-and-conquer (DC) algorithms over powerlists. These rules convert the parallel control structure of DC into a sequential control flow, thereby making the implicit massive data parallelism in a DC scheme explicit. The results given here are illustrated by many examples including Fast Fourier Transform and Batcher's bitonic sort.
ISSN:0167-6423
1872-7964
DOI:10.1016/0167-6423(95)00022-4