96 search results - page 14 / 20 » Quasi-Static Scheduling for Real-Time Systems with Hard and ... |
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
WADS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
LCTRTS
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
RTCSA
2008
IEEE
14 years 2 months ago
2008
IEEE
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...