36 search results - page 2 / 8 » A feasibility decision algorithm for rate monotonic scheduli... |
RTSS
1998
IEEE
13 years 9 months ago
1998
IEEE
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...
RTSS
1999
IEEE
13 years 9 months ago
1999
IEEE
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...
ETFA
2006
IEEE
13 years 8 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
ISORC
2002
IEEE
13 years 9 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...