15 search results - page 1 / 3 » The Global Feasibility and Schedulability of General Task Mo... |
ECRTS
2007
IEEE
13 years 11 months ago
2007
IEEE
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties ...
ETFA
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are wellknown for uni...
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. ...
OPODIS
2010
13 years 2 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...