An efficient algorithm for the creation of single assignment forms

Transformation to single assignment form is presented as a technique enabling the exploitation of fine-grain parallelism in programs. An efficient algorithm is presented for the creation of single assignment and static single assignment code from unstructured FORTRAN code. The algorithm creates code of near optimal quality with respect to both the number of names and assignment statements added to the code. Experimental results show the degree of enlargement of storage and program length when creating single assignment code, and the containment of enlargement using name reclamation. Other results show the extent of improved parallelization using single assignment code