Performance Issues in High Performance Fortran Implementations of Sensor-Based Applications

Issue title: High Performance Fortran Comes of Age

Article type: Research Article

Authors: O'HALLARON, DAVID R. | WEBB, JON | SUBHLOK, JASPAL

Affiliations: School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213; e-mail: droh@cs.cmu.edu,webb+@cmu.edu,jass@cs.cmu.edu

Abstract: Applications that get their inputs from sensors are an important and often overlooked application domain for High Performance Fortran (HPF). Such sensor-based applications typically perform regular operations on dense arrays, and often have latency and through put requirements that can only be achieved with parallel machines. This article describes a study of sensor-based applications, including the fast Fourier transform, synthetic aperture radar imaging, narrowband tracking radar processing, multibaseline stereo imaging, and medical magnetic resonance imaging. The applications are written in a dialect of HPF developed at Carnegie Mellon, and are compiled by the Fx compiler for the Intel Paragon. The main results of the study are that (1) it is possible to realize good performance for realistic sensor-based applications written in HPF and (2) the performance of the applications is determined by the performance of three core operations: independent loops (i.e., loops with no dependences between iterations), reductions, and index permutations. The article discusses the implications for HPF implementations and introduces some simple tests that implementers and users can use to measure the efficiency of the loops, reductions, and index permutations generated by an HPF compiler.

Journal: Scientific Programming, vol. 6, no. 1, pp. 59-72, 1997