Partitioning optimizations in an optimizing compiler
US5193190A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 26, 1989 |
| Grant date | Mar 9, 1993 |
| Priority date | — |
| Expiry date | Jun 26, 2009 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/443
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer program to be compiled is optimized prior to carrying out the final compilation. Subgraphs within the program are identified and examined for optimization beginning with the entire program as the largest subgraph. The number of entities in each subgraph which are relevant to each dimension of arrays used to represent data flow equations is determined. Next, the amount of memory required to contain the arrays is determined. If that memory requirement is within a predefined memory usage limit for the compilation, then a specified procedure of the compilation process is applied. If the memory requirement to contain the arrays exceeds the predefined memory usage limit for the compilation, the process is repeated for successively smaller subgraphs within the program in an attempt to find a subgraph to which the memory limits allow application of the specified procedure.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.