Skip to main content
eScholarship
Open Access Publications from the University of California

System-level timing-constrained scheduling

Abstract

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

- The control-step is not available at system-level.

- Mixed concurrent and exclusive execution flows

- Synchronization among objects scheduled

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

In this paper, we present a data-structure to specify the Input for system-level scheduling, and a system-level timing-constrained scheduling algorithm. Static scheduling, which has no OS overhead and better system WCET, is used. The algorithm presented can obtain near-optimal solutions within acceptable and predictable CPU time.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View