scispace - formally typeset
Search or ask a question

Showing papers by "Rudolf Eigenmann published in 1991"


Book ChapterDOI
07 Aug 1991
TL;DR: The techniques used to hand-parallelize, for the Alliant FX/80, four Fortran programs from the Perfect-Benchmark suite have wide applicability and can be incorporated into existing translators.
Abstract: This paper discusses the techniques used to hand-parallelize, for the Alliant FX/80, four Fortran programs from the Perfect-Benchmark suite. The paper also includes the execution times of the programs before and after the transformations. The four programs considered here were not effectively parallelized by the automatic translators available to the authors. However, most of the techniques used for hand parallelization, and perhaps all of them, have wide applicability and can be incorporated into existing translators.

112 citations



Proceedings Article
01 Jan 1991
TL;DR: This paper reports on the status of the Fortran translator for the Cedar computer at the end of March, 1991, with a discussion of the fortran77 to Cedar Fortran parallelizer that describes the techniques currently being implemented.
Abstract: This paper reports on the status of the Fortran translator for the Cedar computer at the end of March, 1991. A brief description of the Cedar Fortran language is followed by a discussion of the fortran77 to Cedar Fortran parallelizer that describes the techniques currently being implemented. A collection of experiments illustrate the e ectiveness of the current implementation, and point toward new approaches to be incorporated into the system in the near future.

12 citations


Proceedings ArticleDOI
01 Apr 1991
TL;DR: This paper analyzes the computational structure of three di erent conjugate gradient schemes for solving elliptic partial d erential equations, and describes its parallel implementation on the Cedar hierarchical memory multiprocessor from both angles, explicit manual parallelization and automatic compilation.
Abstract: The conjugate gradient method is a powerful algorithm for solving well-structured sparse linear systems that arise from partial di erential equations. The broad application range makes it an interesting object for investigating novel architectures and programming systems. In this paper we analyze the computational structure of three di erent conjugate gradient schemes for solving elliptic partial di erential equations. We describe its parallel implementation on the Cedar hierarchical memory multiprocessor from both angles, explicit manual parallelization and automatic compilation. We report performance measurements taken on Cedar, which allow us a number of conclusions on the Cedar architecture, the programming methodology for hierarchical computer structures, and the contrast of manual vs automatic parallelization.

11 citations