منابع مشابه
A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"
In [1], the author empirically compared EDF (Earliest Deadline First) and RM (Rate Monotonic) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1,000 time units of scheduling activities. However, based on test settings given in [1], the first 1,000 time units occupies only a small percentage of the entire task set’s hyper-period. We ...
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability
Schedulability tests are presented for preemptive earliest-deadlinerst and deadline-monotonic scheduling of periodic real-time tasks on a singlequeue m-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue -server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independe...
متن کامل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 statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given ta...
متن کاملStatistic Rate Monotonic Scheduling
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 statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2005
ISSN: 0922-6443
DOI: 10.1023/b:time.0000048932.30002.d9