NDLI: Algorithms for computing the static single assignment form

Content Provider	ACM Digital Library
Author	Bilardi, Gianfranco Pingali, Keshav
Copyright Year	2003
Abstract	The Static Single Assignment (SSA) form is a program representation used in many optimizing compilers. The key step in converting a program to SSA form is called φ-placement. Many algorithms for φ-placement have been proposed in the literature, but the relationships between these algorithms are not well understood.In this article, we propose a framework within which we systematically derive (i) properties of the SSA form and (ii) φ-placement algorithms. This framework is based on a new relation called $\textit{merge}$ which captures succinctly the structure of a program's control flow graph that is relevant to its SSA form. The φ-placement algorithms we derive include most of the ones described in the literature, as well as several new ones. We also evaluate experimentally the performance of some of these algorithms on the SPEC92 benchmarks.Some of the algorithms described here are optimal for a single variable. However, their repeated application is not necessarily optimal for multiple variables. We conclude the article by describing such an optimal algorithm, based on the transitive reduction of the merge relation, for multi-variable φ-placement in structured programs. The problem for general programs remains open.
Starting Page	375
Ending Page	425
Page Count	51
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/765568.765573
Journal	Journal of the ACM (JACM)
Volume Number	50
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Control dependence Optimizing compilers Program optimization Program transformation Static single assignment form
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficiently computing static single assignment form and the control dependence graph

Continuation-Based Program Transformation Strategies

An Optimizing Program for the IBM 650

Program Improvement by Source-to-Source Transformation

On Single vs. Triple Address Computing Machines

Optimization of Static Loading and Sizing of Multilevel Memory Systems

Nondeterministic Algorithms

Assignment Commands with Array References

Countable nondeterminism and random assignment

Algorithms for computing the static single assignment form

Similar Documents

Efficiently computing static single assignment form and the control dependence graph

Continuation-Based Program Transformation Strategies

An Optimizing Program for the IBM 650

Program Improvement by Source-to-Source Transformation

On Single vs. Triple Address Computing Machines

Optimization of Static Loading and Sizing of Multilevel Memory Systems

Nondeterministic Algorithms

Assignment Commands with Array References

Countable nondeterminism and random assignment

Algorithms for computing the static single assignment form