Transformational re nement in the context of this talk refers to the automatic transformation of a speci cation expressed in a functional programming language typically SML LISP or Miranda to an e cient implementation expressed in an imperative programming language typically FORTRAN or one of its parallel derivitives In particular our work focuses on the derivation of e cient numerical mathemat...

We present Open Multi-Processing (OpenMP) version of Fortran 90 programs for solving the Gross-Pitaevskii (GP) equation for a Bose-Einstein condensate in one, two, and three spatial dimensions, optimized for use with GNU and Intel compilers. We use the split-step Crank-Nicolson algorithm for imaginaryand real-time propagation, which enables efficient calculation of stationary and non-stationary...

SMATASY is an interface for the ZFI TER package and may be used for the model independent description of the Z resonance at LEP 1 and SLC. It allows the determination of the Z mass and width and its resonance shape parameters r and j for cross-sections and their asymmetries. The r describes the peak height and j the interference of the Z resonance with photon exchange in each scattering channel...

Sac is a functional C variant with eecient support for high-level array operations. This paper investigates the applicability of a Sac speciic optimization technique called with-loop-folding to real world applications. As an example program which originates from the Numerical Aerodynamic Simulation (NAS) Program developed at NASA Ames Research Center, the so-called NAS benchmark MG is chosen. I...

Fortran D is a version of Fortran extended with data decomposition speciications. It is designed to provide a machine-independent programming model for data-parallel applications and has heavily innuenced the design of High Performance Fortran (HPF). In previous work we described Fortran D compilation algorithms for individual procedures. This paper presents an interprocedural approach to analy...

We report our experiences with the implementation of InterProcedural Alias Analysis (IPA) for Fortran. Implicit aliasing caused by reference parameter passing can be uncovered in a program with multiple compilation units by interprocedural analysis. For scalar objects and for full arrays, the IPA processor described here finds all alias relations. For indexed array elements and partial arrays, ...

We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-...

During the past decade massively parallel processors (MPPs) have slowly gained acceptancewithin the scientiic community. At present these machines typically contain a few hundred to one thousand oo-the-shelf microprocessors and a total memory of up to 32 GBytes. The potential performance of these machines is illustrated by the fact that a month long job on a high end workstation might require o...

High-level data-parallel languages such as Vienna Fortran and High Performance Fortran (HPF) have been introduced to allow the programming of massively parallel distributed-memory machines at a relatively high level of abstraction, based on the Single-Program-Multiple-Data (SPMD) paradigm. Their main features include mechanisms for expressing the distribution of data across the processors of a ...

As a first step toward the parallel execution analysis of FORTRAN programs, a tool called the Parallel Execution Profiler has been designed and implemented for the graphical postexecution analysis of parallel programs using the Parallel FORTRAN environment as a vehicle for both implementing parallel programs and tracing parallel events. The dynamic behavior of parallel execution is observed int...