Sciweavers

5 search results - page 1 / 1
» Program path analysis to bound cache-related preemption dela...
Sort
View
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 7 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
CODES
2000
IEEE
13 years 11 months ago
Program path analysis to bound cache-related preemption delay in preemptive real-time systems
ÍÒÔÖ Ø Ð Ú ÓÖ Ó Ñ ÑÓÖÝ Ñ × Ø Æ ÙÐØ ØÓ ×Ø Ø ÐÐÝ Ò ÐÝÞ Ø ÛÓÖ×ع × Ô Ö ÓÖÑ Ò Ó Ö Ð¹Ø Ñ ×Ý×Ø Ñ׺ Ì × ÔÖÓ Ð Ñ × Ü ...
Hiroyuki Tomiyama, Nikil D. Dutt
RTAS
2008
IEEE
14 years 1 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
RTCSA
2009
IEEE
14 years 2 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
CODES
2003
IEEE
14 years 18 days ago
Accurate estimation of cache-related preemption delay
Multitasked real-time systems often employ caches to boost performance. However the unpredictable dynamic behavior of caches makes schedulability analysis of such systems difficul...
Hemendra Singh Negi, Tulika Mitra, Abhik Roychoudh...