Sciweavers

21 search results - page 2 / 5
» Constant-time admission control for Deadline Monotonic tasks
Sort
View
RTAS
2006
IEEE
13 years 11 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
RTAS
2007
IEEE
13 years 12 months ago
Middleware Support for Aperiodic Tasks in Distributed Real-Time Systems
Many mission-critical distributed real-time applications must handle aperiodic tasks with end-to-end deadlines. However, existing middleware (e.g., RT-CORBA) lacks schedulability ...
Yuanfang Zhang, Chenyang Lu, Christopher D. Gill, ...
ECRTS
2007
IEEE
13 years 9 months ago
The Space of EDF Feasible Deadlines
It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interf...
Enrico Bini, Giorgio C. Buttazzo
RTSS
1998
IEEE
13 years 10 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros
RTSS
1999
IEEE
13 years 10 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros