Sciweavers

15 search results - page 3 / 3
» Approximation of Worst-Case Execution Time for Preemptive Mu...
Sort
View
RTAS
2010
IEEE
13 years 3 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
14 years 1 months ago
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
Junhyung Um, Taewhan Kim
RTCSA
2006
IEEE
13 years 10 months ago
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah
RTSS
2005
IEEE
13 years 10 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
CASES
2007
ACM
13 years 8 months ago
Performance optimal processor throttling under thermal constraints
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...
Ravishankar Rao, Sarma B. K. Vrudhula