| Abstract |
|
This paper presents a synthesis approach for reactive systems that aims at minimizing the overhead introduced by the operating system and the interaction among the concurrent tasks, while considering multiple concurrent execution resources. A formal model based on the notion of scheduling of Petri nets is used to perform the synthesis. We show how the notion of projections of a schedule for the complete system onto the components implemented on separate resources is essential to de.ne the correctness of the partitioned schedule.
|
 Additional Information
|
Citation:
Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Yosinori Watanabe,
"Quasi-Static Scheduling for Concurrent Architectures,"
acsd,
p. 29,
Third International Conference on Application of Concurrency to System Design (ACSD'03),
2003
|
