Irregular computations in Fortran – expression and implementation strategies

Article type: Research Article

Authors: Prins, Jan F.^; | Chatterjee, Siddhartha | Simons, Martin

Affiliations: Department of Computer Science, The University of North Carolina, Chapel Hill, NC 27599‐3175, USA E‐mail: {prins,sc,simons}@cs.unc.edu

Note: [] Corresponding author.

Abstract: Modern dialects of Fortran enjoy wide use and good support on high‐performance computers as performance‐oriented programming languages. By providing the ability to express nested data parallelism, modern Fortran dialects enable irregular computations to be incorporated into existing applications with minimal rewriting and without sacrificing performance within the regular portions of the application. Since performance of nested data‐parallel computation is unpredictable and often poor using current compilers, we investigate threading and flattening, two source‐to‐source transformation techniques that can improve performance and performance stability. For experimental validation of these techniques, we explore nested data‐parallel implementations of the sparse matrix‐vector product and the Barnes–Hut n‐body algorithm by hand‐coding thread‐based (using OpenMP directives) and flattening‐based versions of these algorithms and evaluating their performance on an SGI Origin 2000 and an NEC SX‐4, two shared‐memory machines.

Journal: Scientific Programming, vol. 7, no. 3‐4, pp. 313-326, 1999