209 search results - page 20 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
VLSID
2002
IEEE
14 years 3 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
RTAS
2009
IEEE
14 years 5 months ago
2009
IEEE
Supporting uninterrupted services for distributed soft real-time applications is hard in resource-constrained and dynamic environments, where processor or process failures and sys...
RTAS
2008
IEEE
14 years 5 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
ETFA
2006
IEEE
14 years 2 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
IPPS
2003
IEEE
14 years 4 months ago
2003
IEEE
With the current trend in integration of more complex systems on chip there is a need for better communication infrastructure on chip that will increase the available bandwidth an...