Sciweavers

506 search results - page 53 / 102
» State-Dependent Deadline Scheduling
Sort
View
IPPS
2003
IEEE
15 years 10 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 multiproce...
Josep M. Banús, Alex Arenas, Jesús L...
ECRTS
2002
IEEE
15 years 10 months ago
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson
IPPS
1998
IEEE
15 years 9 months ago
An Evolutionary Approach to Multiprocessor Scheduling of Dependent Tasks
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
Roman Nossal
RTSS
1995
IEEE
15 years 9 months ago
Dual Priority Scheduling
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to...
Robert I. Davis, Andy J. Wellings
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
15 years 7 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...