Compile-time scheduling
US11003429B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 4, 2019 |
| Grant date | May 11, 2021 |
| Priority date | — |
| Expiry date | Feb 4, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9024
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Scheduling of the operations of an integrated circuit device such as a hardware accelerator, including scheduling of movement of data into and out of the accelerator, can be performed by a compiler that produces program code for the accelerator. The compiler can produce a graph that represents operations to be performed by the accelerator. Using the graph, the compiler can determine estimated execution times for the operations represented by each node in the graph. The compiler can schedule operations by determining an estimated execution time for set of dependent operations that depend from an operation. The compiler can then select an operation that has a shortest estimated execution time from among a set of operations and which has a set of dependent operations that has a longest estimated execution time as compared to other sets of dependent operations.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.