loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The 14th International Conference on VLSI Design (VLSID '01)
Satisfying Timing Constraints of Preemptive Real-Time Tasks through Task Layout Technique
Bangalore, India
January 03-January 07
ISBN: 0-7695-0831-6
Anupam Datta, Indian Institute of Technology, Kharagpur
Sidharth Choudhury, Indian Institute of Technology, Kharagpur
Anupam Basu, Indian Institute of Technology, Kharagpur
Hiroyuki Tomiyama, University of California, Irvine
Nikil Dutt, University of California, Irvine
In multi-tasking preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT)s of the tasks can be obtained if the layout of the tasks is taken into account in the analysis. This is because the Cache Related Preemption Delay(CRPD) depends on the inter-task interference in the cache. We present an ILP formulation and an algorithm for generating a layout of the tasks such that the timing constraints of all the tasks are met. An attempt is made to generate a layout such that the CRPD is reduced for all the tasks. The performance of the proposed formulation is demonstrated.
Citation:
Anupam Datta, Sidharth Choudhury, Anupam Basu, Hiroyuki Tomiyama, Nikil Dutt, "Satisfying Timing Constraints of Preemptive Real-Time Tasks through Task Layout Technique," vlsid, pp.97, The 14th International Conference on VLSI Design (VLSID '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.