TAU for HPF

The current TAU for HPF implementation is based on the HPF compiler available from The Portland Group, Inc. (PGI). Their pghpf compiler already supports profiling, so in order to use the TAU for HPF tools, the user only has to link his/her HPF program with the TAU implementation of the profiling runtime system functions (which generates TAU compatible profiling data output as well as the file, function, and callgraph information for fancy and cagey, if necessary). However, the static information can also be generated by a small HPF file and function scanner (which is implemented as an extra phase after the normal HPF compilation steps). This is the preferred way, as it allows program browsing before/without running the program and it keeps the runtime overhead small. The TAU tools did not have to be changed.

The example used in the screendumps below is PDE1, one program of the GENESIS Distributed Memory Benchmark suite written in Subset HPF. The benchmark solves the Poisson-Equation on a 3-dimensional grid by parallel red-black succesive over relaxation with Chebyshev acceleration. The benchmark ran on a 8 processor SGI PowerChallenge.

FANCY

CAGEY

RACY