Sciweavers

84 search results - page 16 / 17
» Online real-time preemptive scheduling of jobs with deadline...
Sort
View
RTAS
2005
IEEE
13 years 11 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
RTSS
2005
IEEE
13 years 11 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
ECRTS
2009
IEEE
13 years 3 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler
RTAS
2005
IEEE
13 years 11 months ago
Energy-Aware Task Allocation for Rate Monotonic Scheduling
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Tarek A. AlEnawy, Hakan Aydin
RTSS
1998
IEEE
13 years 9 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson