The Efficient Computation of Ownership Sets in HPF
IEEE Transactions on Parallel and Distributed Systems
ORT: a communication library for orthogonal processor groups
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
ParAgent: A Domain-Specific Semi-automatic Parallelization Tool
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Library support for hierarchical multi-processor tasks
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A MATLAB Compiler for Distributed, Heterogeneous, Reconfigurable Computing Systems
FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Tlib-a library to support programming with hierarchical multi-processor tasks
Journal of Parallel and Distributed Computing
Communicating Multiprocessor-Tasks
Languages and Compilers for Parallel Computing
Component-based programming techniques for coarse-grained parallelism
Proceedings of the 19th High Performance Computing Symposia
| Hi-index | 0.00 |
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM.The metrics considered include compilation times, execution times, and communication costs. We compare all of these metrics against commercial, industrial strength compilers such as pghpf (v 2.2) and xlhpf (v 1.01) and show the superior benefits of PARADIGM (v 2.0) in all of the metrics used. We also demonstrate how robustly our framework performs in the presence of arbitrary alignments and distributions.The framework's symbolic manipulation capability is derived from an off-the-shelf commercial symbolic analysis software called Mathematica.b Measured metrics for a few popular benchmarks such as Automatic Differentiation and Integration (ADI), Euler Fluxes, TOMCATV and 2-D Explicit Hydrodynamics (EXPL) have been presented.