209 search results - page 19 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
103
click to vote
ISOLA
2010
Springer
14 years 10 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
16 years 4 days 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...
102
click to vote
RTAS
2010
IEEE
14 years 10 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...
107
click to vote
ICPPW
2005
IEEE
15 years 5 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...
136
click to vote
OPODIS
2010
14 years 9 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...