209 search results - page 6 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
PDP
2002
IEEE
2002
IEEE
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
14 years 10 days ago
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
SUTC
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose ...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
Current hard real-time scheduling and analysis techniques are unable to efficiently utilize the computational bandwidth provided by multicore platforms. This is due to the large ...