Sciweavers

309 search results - page 4 / 62
» The Partitioned Multiprocessor Scheduling of Sporadic Task S...
Sort
View
RTS
2006
138views more  RTS 2006»
13 years 4 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...
Theodore P. Baker
IPPS
2003
IEEE
13 years 10 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
RTS
2008
133views more  RTS 2008»
13 years 4 months ago
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where ...
Sanjoy K. Baruah, Nathan Fisher
RTAS
2009
IEEE
13 years 11 months ago
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that quali...
Shinpei Kato, Nobuyuki Yamasaki
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 5 months ago
Integrating Job Parallelism in Real-Time Scheduling Theory
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. ...
Sébastien Collette, Liliana Cucu, Joël...