Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Satisfying timing constraints of preemptive real-time tasks through task layout technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Datta, A. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; Choudhury, S. ; Basu, A. ; Tomiyama, H.
more authors

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

Published in:

VLSI Design, 2001. Fourteenth International Conference on

Date of Conference:

2001