loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00)
Bounding the execution time of real-time tasks on modern processors
Cheju Island, South Korea
December 12-December 14
ISBN: 0-7695-0930-4
S.M. Petters, Inst. for Real-Time Comput. Syst., Tech. Univ. Munchen, Germany
Finding a tight estimate on the execution time of tasks in embedded hard real time systems is gaining complexity and importance. Up-to-date processors are equipped with acceleration techniques to bridge the gap between the fast core frequency of the processors and the comparably slow main memory. On the other hand, the application field of real time systems is continuously widening to more complex systems. To keep up with the evolution of processors, it is proposed to lay more weight on measurement and less on modeling. By analyzing the control flow graph the compiler uses for optimization, systematic information on how the code has to be measured can be gained. Using this information, the code can be automatically instrumented and measured to bound the execution time of the real time tasks.
Index Terms:
real-time systems; computer architecture; flow graphs; optimising compilers; task execution time; real time tasks; modern processors; embedded hard real time systems; up-to-date processors; acceleration techniques; fast core frequency; main memory; complex systems; control flow graph; systematic information
Citation:
S.M. Petters, "Bounding the execution time of real-time tasks on modern processors," rtcsa, pp.498, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.