Sciweavers

40 search results - page 2 / 8
» Robust Aperiodic Scheduling Under Dynamic Priority Systems
Sort
View
RTCSA
1995
IEEE
13 years 8 months ago
A soft aperiodic task scheduling algorithm in dynamic-priority systems
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
Sungyoung Lee, Hyungill Kim, Jongwon Lee
RTSS
2007
IEEE
13 years 11 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
RTCSA
2000
IEEE
13 years 9 months ago
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
Radu Dobrin, Yusuf Özdemir, Gerhard Fohler
ECRTS
1999
IEEE
13 years 9 months ago
Performance of algorithms for scheduling real-time systems with overrun and overload
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing th...
Mark K. Gardner, Jane W.-S. Liu
LCTRTS
2004
Springer
13 years 10 months ago
Procrastination scheduling in fixed priority real-time systems
Procrastination scheduling has gained importance for energy efficiency due to the rapid increase in the leakage power consumption. Under procrastination scheduling, task executio...
Ravindra Jejurikar, Rajesh K. Gupta