Sciweavers

8 search results - page 1 / 2
» Deterministic and Statistical Deadline Guarantees for a Mixe...
Sort
View
RTCSA
2003
IEEE
13 years 10 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
RTSS
2000
IEEE
13 years 8 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
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
RTCSA
2006
IEEE
13 years 11 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...
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