loading...
Definition of Task Allocation and Priority Assignment in Hard Real-Time Distributed Systems
Tucson, Arizona, USA December 03-December 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2007.4028th IEEE International Real-Time Sys ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The complexity and physical distribution of modern ac- tive safety, chassis and powertrain automotive applications requires the use of distributed architectures. Complex func- tions designed as networks of function blocks exchanging signal information are deployed onto the physical HW and implemented in a SW architecture consisting of a set of tasks and messages. The typical configuration features priority- based scheduling of tasks and messages and imposes end- to-end deadlines. In this work, we optimize the task place- ment and the signal to message mapping and we automate the assignment of priorities to tasks and messages in order to meet end-to-end deadline constraints and minimize la- tencies. This is accomplished by leveraging worst case re- sponse time analysis within a mixed integer linear optimiza- tion framework. Our approach is applied to an automotive case study to prove its feasibility.
Citation:
Wei Zheng, Qi Zhu, Marco Di Natale, Alberto Sangiovanni Vincentelli, "Definition of Task Allocation and Priority Assignment in Hard Real-Time Distributed Systems," rtss, pp.161-170, 28th IEEE International Real-Time Systems Symposium (RTSS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions