System and method for optimizing computer code using a compact data flow representation
US5448737A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Mar 17, 1992 |
| Grant date | Sep 5, 1995 |
| Priority date | — |
| Expiry date | Mar 17, 2012 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/433
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention provides a system and method for optimizing or parallelizing computer code typically represented by a source program. The source program is represented by a control flow graph. The present invention includes an optimizer for constructing a compact data flow representation from the control flow graph and a mechanism for evaluating the compact data flow representation in relation to a data flow framework in order to determine a solution to a particular data flow problem. The present invention represents data flow chains compactly, obtaining some of the advantages of Static Single Assignment (SSA) form without modification of program text (i.e., renaming). In addition, the present invention represents compactly certain data flow chains which SSA form fails to represent (i.e. def-def, use-def, and use-use chains). The data flow representation of the present invention combines information only once in the graph, information is forwarded directly to where it is needed, and useless information is not represented.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.