209 search results - page 19 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
ISOLA
2010
Springer
13 years 9 months ago
2010
Springer
During the design iterations of embedded systems, the schedulability analysis is an important method to verify whether the real-time constraints are satisfied. In order to achieve...
VLSID
2008
IEEE
14 years 11 months ago
2008
IEEE
Worst-case execution time (WCET) analysis and, in general, the predictability of real-time applications implemented on multiprocessor systems has been addressed only in very restri...
RTAS
2010
IEEE
13 years 9 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
ICPPW
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
OPODIS
2010
13 years 8 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...