Sciweavers

77 search results - page 4 / 16
» Statistical Rate Monotonic Scheduling
Sort
View
RTAS
2006
IEEE
14 years 2 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
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Scheduling with Rate Adaptation under Incomplete Knowledge of Channel/Estimator Statistics
In time-varying wireless networks, the states of the communication channels are subject to random variations, and hence need to be estimated for efficient rate adaptation and sched...
Wenzhuo Ouyang, Sugumar Murugesan, Atilla Eryilmaz...
ETFA
2006
IEEE
14 years 7 days ago
Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constrai
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...
Patrick Meumeu Yomsi, Yves Sorel
IPPS
2008
IEEE
14 years 3 months ago
Portioned static-priority scheduling on multiprocessors
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on...
Shinpei Kato, Nobuyuki Yamasaki
ECRTS
1999
IEEE
14 years 27 days ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...