Donald Bren School of Information and Computer Sciences

HLS scheduling algorithms can not be applied on system-level synthesis due to the following problems.

- The clock is no longer able to align the scheduled objects at system-level

- Combined concurrent and exclusive execution flows

- Synchronization precedences among the scheduled objects

- Execution time of the scheduled objects may not be determined until run-time.

In this paper, we present an extended task graph to capture the system-level scheduling problems. We define the system-level time-constraint scheduling problems based on the extended task graph, and a scheduling algorithm is presented. Static scheduling, which can have less OS overhead and better system WCET, is used. The algorithm can obtain good solutions within acceptable and predictable CPU time.