The paper includes algorithms that could be used by compiler implementers. A paper by the Kennedy gang gives a good overview of both compilers, and points the way toward more portable parallel programming in the future. It is certainly the case that one must deal with the linearized arrays in a program before converting it to HPF, so tools to do this are welcome. Ken Kennedy et al. Sips considers both the local enumeration and local storage compression problem.
Several papers address the issue of run-time data redistribution.
First, the communications are expressed as statements in a communications algebra. The statements are reduced, and then pattern matching is performed. Certain idioms are mapped to efficient routines in a runtime library. Other compiler research projects attempt to optimize communications. Communications optimization is crucial for HPF compilers.