Sciweavers

Share
IPPS
2003
IEEE

Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor

9 years 4 months ago
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
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 multiprocessor systems. The goal is to achieve low mean aperiodic response times while meeting all periodic task deadlines. Our proposal allows periodic and aperiodic tasks to migrate to other processors to improve aperiodic mean response time. We show via extensive simulations that our approach gives better results than local Slack Stealing schedulers.
Josep M. Banús, Alex Arenas, Jesús L
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where IPPS
Authors Josep M. Banús, Alex Arenas, Jesús Labarta
Comments (0)
books