Abstract
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 codes, including programs with irreducible flow graphs. The algorithm transforms code directly without requiring conversion to flow graph form. 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 parallelizalion using single assignment code.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
