Sciweavers

91 search results - page 2 / 19
» Improved Schedulability Analysis of EDF on Multiprocessor Pl...
Sort
View
ECRTS
2007
IEEE
14 years 1 months ago
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
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...
Nathan Fisher, Sanjoy K. Baruah
RTS
2008
133views more  RTS 2008»
13 years 7 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
OPODIS
2010
13 years 5 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
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...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
RTSS
2003
IEEE
14 years 21 days ago
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
Theodore P. Baker
ECRTS
2006
IEEE
14 years 1 months ago
Task Reweighting under Global Scheduling on Multiprocessors
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...