The problem of optimal software synthesis for concurrent processes to be implemented on a single processor is addressed. The approach calls for the representation of the concurrent processes with Petri nets that give a theoretical foundation for the scheduling algorithm that sequentializes the concurrent processes and for the code generation step. The approach maximizes the amount of static scheduling to reduce the need of context switch and operating system intervention. Experimental results show the potential of our method to reduce software design time and errors.
Task generation and compile-time scheduling for mixed data-control embedded software / J., Cortadella; A., Kondratyev; Lavagno, Luciano; M., Massot; S., Moral; Passerone, Claudio; Y., Watanabe; A., SANGIOVANNI VINCENTELLI. - (2000), pp. 489-494. (Intervento presentato al convegno 37th IEEE/ACM Design Automation Conference tenutosi a Los Angeles CA (USA) nel June 5-8, 2000) [10.1145/337292.337553].
Task generation and compile-time scheduling for mixed data-control embedded software
LAVAGNO, Luciano;PASSERONE, Claudio;
2000
Abstract
The problem of optimal software synthesis for concurrent processes to be implemented on a single processor is addressed. The approach calls for the representation of the concurrent processes with Petri nets that give a theoretical foundation for the scheduling algorithm that sequentializes the concurrent processes and for the code generation step. The approach maximizes the amount of static scheduling to reduce the need of context switch and operating system intervention. Experimental results show the potential of our method to reduce software design time and errors.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1679829
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo