Optimization of initialization of parallel compare predicates in a computer system
US6505345B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 18, 2000 |
| Grant date | Jan 7, 2003 |
| Priority date | — |
| Expiry date | Jan 18, 2020 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/30072
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An optimization process is disclosed. The process first finds a parallel compare sequence in a program flow, for example using a flow graph. The guarding predicate (gp) is obtained for the compares. If a new dominating predicate (dp) can be found, the process proceeds to determining if compares for the dp generate the correct or needed initial value for the gp. If there are free result slots available, the proper compares are generated and folded into the initialization. If no free slots are available, it is determined if there is a use of a gp between the dp and gp. If not, the dp is renamed to gp, and the proper compares are generated and folded into the initialization. If there is such a use, the guarding predicate of the compares is found and the process reiterates until it ends with the failure to find a new dominating predicate dp.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.