## Diffusion: Calculating Efficient Parallel Programs (1999)

Venue: | In 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM ’99 |

Citations: | 9 - 7 self |

### BibTeX

@INPROCEEDINGS{Hu99diffusion:calculating,

author = {Zhenjiang Hu and Masato Takeichi and Hideya Iwasaki},

title = {Diffusion: Calculating Efficient Parallel Programs},

booktitle = {In 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM ’99},

year = {1999},

pages = {85--94}

}

### Years of Citing Articles

### OpenURL

### Abstract

Parallel primitives (skeletons) intend to encourage programmers to build a parallel program from ready-made components for which efficient implementations are known to exist, making the parallelization process easier. However, programmers often suffer from the difficulty to choose a combination of proper parallel primitives so as to construct efficient parallel programs. To overcome this difficulty, we shall propose a new transformation, called diffusion, which can efficiently decompose a recursive definition into several functions such that each function can be described by some parallel primitive. This allows programmers to describe algorithms in a more natural recursive form. We demonstrate our idea with several interesting examples. Our diffusion transformation should be significant not only in development of new parallel algorithms, but also in construction of parallelizing compilers. Keywords: Bird Meertens Formalisms, Data Parallelism, Parallelization, Skeletal Parallel program...