Massive parallelization of divide-and-conquer algorithms over powerlists. Science of Computer Programming, 26:59--78 (1996)
by
Klaus Achatz
,
Wolfram Schulte
,
Fakultät Für Informatik
,
Universität Ulm
| Venue: | In 4th Principles and Practice of Parallel Programming |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Achatz96massiveparallelization,
author = {Klaus Achatz and Wolfram Schulte and Fakultät Für Informatik and Universität Ulm},
title = {Massive parallelization of divide-and-conquer algorithms over powerlists. Science of Computer Programming, 26:59--78},
booktitle = {In 4th Principles and Practice of Parallel Programming},
year = {1996},
pages = {102--111},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It contains all proofs of the introduced transformation rules as well as programming examples on a SIMD computer.
Citations
| 191 | The Cube Connected Cycles: A Versatile Network for Parallel Computers - Preparata, Vuillemin - 1981 |
| 79 | Prefix sums and their applications - Blelloch - 1990 |
| 63 | Specification and Transformation of Programs - Partsch - 1990 |
| 39 | The Bird-Meertens Formalism as a Parallel Model - Skillicorn - 1992 |
| 19 | Parallel computing comes of age: supercomputer level parallel computations at Caltech, Concurrency Practice Exper - Fox - 1989 |
| 15 | An algebraic model for divide-and-conquer algorithms and its parallelism - Mou, Hudak - 1988 |
| 10 | Compile-time transformations and optimization of parallel divide-and-conquer algorithms - Carpentieri, Mou - 1991 |
| 9 | Architecture independent massive parallelization of divide-and-conquer algorithms - Achatz, Schulte - 1995 |
| 1 | Series F: Computer and systems sciences - Blelloch - 1989 |
| 1 | Powerlist: A structure for parallel recursion - Practice, Experience - 1994 |
