Quasi-static scheduling for concurrent architectures

被引:2
作者
Cortadella, J [1 ]
Kondratyev, A [1 ]
Lavagno, L [1 ]
Watanabe, Y [1 ]
机构
[1] Univ Politecn Catalunya, Barcelona, Spain
来源
THIRD INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS | 2003年
关键词
D O I
10.1109/CSD.2003.1207697
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 define the correctness of the partitioned schedule.
引用
收藏
页码:29 / 40
页数:12
相关论文
共 14 条
[1]  
[Anonymous], 1985, INT SERIES COMP SCI
[2]  
ARRIGONI G, 2002, P DES AUT TEST EUR C
[3]  
BUCK JT, 1993, THESIS UC BERKELEY
[4]  
CORTADELLA J, 2000, P 37 DES AUT C JUN
[5]  
CORTADELLA J, 2002, P INT C APPL THEOR P
[6]  
DEKOCK EA, 2000, P 37 DES AUT C JUN
[7]  
Halbwachs N., 1993, Synchronous Programming of Reactive Systems
[8]  
HAREL D, 1990, IEEE T SOFTWARE ENG, V16
[9]  
Kahn G., 1974, P IFIP C AUG
[10]  
KOPETZ H, 1994, IEEE COMPTUE, V27