Fast multi-pass partitioning via priority based scheduling
US7589719B2 · kind B2 · utility
Assignees
Inventors
Key dates
| Filing date | Jul 15, 2005 |
| Grant date | Sep 15, 2009 |
| Priority date | — |
| Expiry date | Jun 6, 2027 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T15/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Computer operations are partitioned for execution by a processor. A plurality of operations to be partitioned is received. The respective priorities for each of the plurality of operations is determined. Ready operations are identified, where a ready operation is an operation that does not have any predecessor operations that have not yet been added to a partition. A determination is made whether adding the ready operations with the highest priorities to the current partition would violate a hardware resource constraint. Based on this determination, the ready operations are added to the partition. The operations added to the partition are provided to a processor for execution.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.