loading...
Priority Refinement for Dependent Tasks in Large Embedded Real-Time Software
San Francisco, CA March 07-March 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTAS.2005.4111th IEEE Real Time and Embedded Tech ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jeffrey R. Merrick, The University of Michigan, Ann Arbor
Shige Wang, The University of Michigan, Ann Arbor
Kang G. Shin, The University of Michigan, Ann Arbor
Jing Song, Ford Motor Company
William Milam, Ford Motor Company
In a large embedded real-time system, priority assignment can greatly affect the timing behavior-which can consequently affect the overall behavior-of the system. Thus, it is crucial for model-based design of a large embedded real-time system to be able to intelligently assign priorities such that tasks can meet their deadlines. In this paper, we propose a priority-refinement method for dependent tasks distributed throughout a heterogeneous multiprocessor environment. In this method, we refine an initial priority assignment iteratively using the simulated annealing technique with tasks' latest completion times (LCT). Our evaluations, based on randomly-generated models, have shown that the refinement method outperforms other priority-assignment schemes and scales well for large, complex, real-time systems. This method has been implemented in the Automatic Integration of Reusable Embedded Software (AIRES) toolkit and has been successfully applied to a vehicle system control application.
Citation:
Jeffrey R. Merrick, Shige Wang, Kang G. Shin, Jing Song, William Milam, "Priority Refinement for Dependent Tasks in Large Embedded Real-Time Software," rtas, pp.365-374, 11th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.