PARADIGM (version 2.0): a new HPF compilation system

Joisha, Pramod G.; Banerjee, P.

doi:10.1109/ipps.1999.760540

Cited by 9 publications

(4 citation statements)

References 10 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, it is a powerful symbolic analysis tools and supports solvers at the integer and real domain, avoiding the translation of arithmetic expressions to binary numbers. Finally, arithmetic expression manipulation with Mathematica has been used efficiently in the past for several compiler problems [12], [13].…”

Section: Mathematicamentioning

confidence: 99%

An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications

Liveris

Zhou

Banerjee

2005

14th Asian Test Symposium (ATS'05)

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Mathematicamentioning

confidence: 99%

An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications

Liveris

Zhou

Banerjee

2005

14th Asian Test Symposium (ATS'05)

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is expressed by grouping subroutine calls to modules if they are executed by the same processor group. An exploitation of task and data parallelism in the context of a parallelizing compiler can be found in the Paradigm compiler [24][25][26]. The Paradigm compiler provides a framework that expresses task parallelism by a macro data-flow graph which has been derived from the hierarchical task graphs used in the Parafrase compiler [27].…”

Section: Comparison With Related Workmentioning

confidence: 99%

Group‐SPMD programming with orthogonal processor groups

Rauber

Reilein

Rünger

2004

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYMany programs for message-passing machines can benefit from an implementation in a group-SPMD programming model due to the potential to reduce communication overhead and to increase scalability. In this paper, we consider group-SPMD programs exploiting different orthogonal processor partitions in one program. For each program this is a fixed set of predefined processor partitions given by the parallel hyperplanes of a two-or multi-dimensional virtual processor organization. We introduce a library built on top of MPI to support the programming with those orthogonal processor groups. The parallel programming model is appropriate for applications with a multi-dimensional task grid and task dependencies mainly aligned in the dimensions of the task grid. The library can be used to specify the appropriate processor partitions, which are then created by the library, and to define the mapping of tasks to the processor hyperplanes. Examples from numerical analysis illustrate the programming style and show that the runtime on distributed memory machines can be considerably reduced by using the library.

show abstract

“…An exploitation of task and data parallelism in the context of a parallelizing compiler can be found in the Paradigm project [11,15]. The Paradigm compiler provides a framework that expresses task parallelism by a macro data-flow graph which has been derived from the hierarchical task graphs used in the Parafrase compiler [3].…”

Section: Related Workmentioning

confidence: 99%

Library Support for Hierarchical Multi-Processor Tasks

Rauber

Rünger²

2002

ACM/IEEE SC 2002 Conference (SC'02)

View full text Add to dashboard Cite

The paper considers the modular programming with hierarchically structured multi-processor tasks on top of SPMD tasks for distributed memory machines. The parallel execution requires a corresponding decomposition of the set of processors into a hierarchical group structure onto which the tasks are mapped. This results in a multi-level group SPMD computation model with varying processor group structures. The advantage of this kind of mixed task and data parallelism is a potential to reduce the communication overhead and to increase scalability. We present a runtime library to support the coordination of hierarchically structured multi-processor tasks. The library exploits an extended parallel group SPMD programming model and manages the entire task execution including the dynamic hierarchy of processor groups. The library is built on top of MPI, has an easy-to-use interface, and leads to only a marginal overhead while allowing static planning and dynamic restructuring.

show abstract

PARADIGM (version 2.0): a new HPF compilation system

Abstract: In

Cited by 9 publications

References 10 publications

An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications

An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications

Group‐SPMD programming with orthogonal processor groups

Library Support for Hierarchical Multi-Processor Tasks

Contact Info

Product

Resources

About