Lowering HPF Procedure Interface to a Canonical Representation


Handling the procedure interface in an HPF compiler is complex due to the many possible combinations of Fortran 90/HPF properties of an actual array argument and its associated dummy argument. This paper describes an algorithm that reduces this complexity by mapping all the combinations of properties to a small set of canonical Internal Representations. These internal representations as well as the necessary run-time decsriptors are also described. The algorithm has been implemented in the commercial HPF compiler produced by the Prepare project. 1 Introduction In the recently completed Prepare project [9] a commercial HPF 2.0 compiler ([6], [7]) has been implemented. Most current HPF compilers first generate C or fortran code as intermediate representation which is than translated by a conventional compiler to code for the target processor. This facilitates the retargeting of the compiler to another processor, but hampers code quality due to the limitations of C and fortran. In contr..

Similar works

Full text

oaioai:CiteSeerX.psu:10.1...Last time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.