The portion of the listing file that summarizes PFA's actions.

A PFA directive that asserts something about the program. For example, an assertion can assert that a particular array is a permutation vector. PFA does not verify the validity of assertions.

When no iteration of a loop writes to a memory location that is read or written by any other iteration of that loop.

A command, specified within the source file, that requests a particular action from PFA. For example, directives enable, disable, or modify a feature of PFA.

An assertion that is placed on the first line of the input file. PFA interprets global assertions as if they appear at the top of each program unit in the file. See also, assertion.

Directives that are placed on the first line of the input file. PFA interprets global directives as if they appear at the top of each program unit in the file. See also, directive.

The process of replacing a call to an external routine with the actual code.

A transformed version of a Fortran source program generated by PFA. This file name has the suffix .m.

The process of analyzing an external routine ahead of time and using the results when the routine is referenced.

An annotated listing of the parts of a source program that can and cannot run in parallel on multiple processor generated by PFA. This file has the suffix .1.

A reduction that uses the max() intrinsic function. See also, reduction.

A reduction that uses the min() intrinsic function. See also, reduction.

Manipulating code so that it can be run in parallel.

A permutation vector used to index into an array. Because all the numbers in the permutation vector are different, when used as indexes they all refer to different array elements.

Any list of numbers that are all different.

A source-to-source preprocessor that analyzes a program and identifies loops that do not contain data dependencies.

A reduction that uses the multiply operator *. See also, reduction.

A process that produces detailed information about program execution, such as details about areas of code where most of the execution time is spent. The prof(1) command produces profiling information.

An operation that reduces a set of values to one value.

The inaccuracy resulting from rounding off values in a calculation.

A reduction that uses the add operator +. See also, reduction.