99 search results - page 2 / 20 » Online Scheduling with Bounded Migration |
RTS
2008
13 years 5 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. ...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
RTAS
2005
IEEE
13 years 11 months ago
2005
IEEE
—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 ...
ECRTS
2006
IEEE
13 years 11 months ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...