This section is an introduction to HPF for Fortran programmers. No previous knowledge of HPF is presumed. This tutorial contains general information about HPF, as well as some information about special characteristics of Digital's implementation of HPF. This tutorial section contains: o Chapter 2, LU Decomposition- This chapter introduces the FORALL construct, the INDEPENDENT directive, and HPF data distribution. o Chapter 3, Solving Nearest Neighbor Problems-This chapter discusses BLOCK distribution, and Digital Fortran 90's optimization of nearest neighbor problems. o Chapter 4, Visualizing the Mandelbrot Set-This chapter presents the use of the PURE attribute, the use of non-Fortran subprograms within an HPF program, and the use of non-parallel HPF subprograms. o Chapter 5, Simulating Network Striped Files-This chapter presents techniques for parallel Input/Output, as well as local subroutines (parameterized by processor), and passing distributed arrays through the procedure interface. 19
