Applications Benchmark Set for Fortran-D and High Performance Fortran

Fortran77, the currently accepted Fortran standard worldwide, is essentially a sequential language which hides the parallelism of a problem in sequential constructs like loops, etc. Consequently, scientists wishing to use parallel computers must rewrite their programs in an extension of Fortran that explicitly re ects the architecture of the underlying machine, such as a message-passing dialect for MIMD distributed-memory machines, array syntax for SIMD machines, or an explicitly parallel dialect with synchronization for MIMD shared-memory machines. This conversion is di cult, error prone, and the resulting parallel codes are machine-speci c. To overcome these problems a new Fortran standard, or more precisely, a standard of Fortran extensions, are necessary to establish a machine independent programming model that is easy to use and yet, is acceptably e cient on di erent parallel architectures. Thus research is now concentrated on the provision of appropriate high-level language constructs to enable users to design programs in much the same way as they are accustomed to on a sequential machine. Several proposals have been put forth in recent months for a set of language extension to achieve this. To coordinate these e orts the High Performance Fortran Forum (HPFF) has been created. HPFF is a coalition of industrial and academic groups working to develop an industry-wide standard of extensions to Fortran which provide support for high performance programming on a wide variety of machines, portable from workstations to massively parallel SIMD and MIMD supercomputers. Fortran-D, a version of Fortran enhanced with data decomposition directives, can provide such a programming model. We believe that it can make parallel computing truly usable. One of the elements of this program is to establish a reliable validation strategy. In order to evaluate the e ciency of automatic data partitioning schemes, a dedicated benchmarking suite is being developed at NPAC and is described in this paper. Currently, the suite is oriented towards validation of the Fortran-D compiler, which is also being developed at NPAC in collaboration with Rice University. We plan to augment it with applications written in other proposed HPF dialects. 1 This work was sponsored by DARPA under contract #DABT63-91-C-0028. The content of the information does not necessarily re ect the position or the policy of the Government and no o cial endorsement should be inferred. Additional support was also provided by CRPC under NSF Cooperative agreement Nos. CCR-9120008 and CDA-8619893 with support from the Keck foundation Northeast Parallel Architectures Center at Syracuse University, NY Northeast Parallel Architectures Center Syracuse University Science and Technology Center 111 College Place Syracuse, NY 13244-4100 S Y R A C U S E U N I V E R S I T Y 1 8 7 0 . . . Submission to: Concurrency Applications Benchmark Set for Fortran-D and High Performance Fortran 2

[1]  A. George,et al.  Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .

[2]  John R. Rice,et al.  Problems to Test Parallel and Vector Languages -- II , 1990 .

[3]  J. R. Mautz,et al.  Transmission from a Rectangular Waveguide into Half Space through a Rectangular Aperture , 1976 .

[4]  Geoffrey C. Fox,et al.  High Performance Scalable Matrix Algebra Algorithms for Distributed Memory Architectures , 1992 .

[5]  Geoffrey C. Fox,et al.  Implementation of Electromagnetic Scattering From Conductors , 1993, PPSC.

[6]  Roger F. Harrington,et al.  A generalized network formulation for aperture problems , 1976 .

[7]  Kim Mills,et al.  A large scale comparison of option pricing models with historical market data , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[8]  J. Swinburne.  Electromagnetic Theory , 1894, Nature.

[9]  Roger F. Harrington,et al.  Field computation by moment methods , 1968 .

[10]  R. F. Harrington,et al.  Implementation of electromagnetic scattering from conductors containing loaded slots on the connection machine CM-2 , 1993 .

[11]  K. Kurokawa,et al.  An introduction to the theory of microwave circuits , 1969 .

[12]  R. Harrington.  Matrix methods for field problems , 1967 .

[13]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[14]  Roger F. Harrington,et al.  Modal analysis of loaded N-port scatterers , 1972 .

[15]  E. Jordan,et al.  Electromagnetic Waves and Radiating Systems , 1951 .

[16]  Michel J. Daydé,et al.  Level 3 Blas in Lu Factorization On the Cray-2, Eta-10P, and Ibm 3090-200/Vf , 1989, Int. J. High Perform. Comput. Appl..

[17]  Tom Blank,et al.  The MasPar MP-1 architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[18]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[19]  Siegfried Benkner,et al.  Vienna Fortran 90 , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..

[20]  Alan G. White,et al.  The Pricing of Options on Assets with Stochastic Volatilities , 1987 .

[21]  J. Richmond,et al.  Sinusoidal reaction formulation for radiation and scattering from conducting surfaces , 1975 .

[22]  Ken Kennedy,et al.  Compiling Fortran 77D and 90D for MIMD distributed-memory machines , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[23]  Jack Dongarra,et al.  LAPACK Working Note 24: LAPACK Block Factorization Algorithms on the INtel iPSC/860 , 1990 .

[24]  Geoffrey C. Fox,et al.  Blocked LU Factorization on a Multiprocessor Computer , 1993 .