Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

RTSS
2003
IEEE

favoriteEmaildiscussreport

188views Control Systems» more RTSS 2003»

Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

13 years 9 months ago

Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

Download websrv.cs.fsu.edu

Schedulability tests are presented for preemptive earliest-deadline-ﬁrst and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.

Theodore P. Baker

Real-time Traffic

Applied Computing | Multiprocessor Schedulability Tests | RTSS 2003 | Schedulability Tests | Sporadic Real-time Tasks |

claim paper

Related Content

» Improved multiprocessor global schedulability analysis

» Improved Schedulability Analysis of EDF on Multiprocessor Platforms

» FaultTolerant Partitioning Scheduling Algorithms in RealTime Multiprocessor Systems

» Rate Monotonic vs EDF Judgment Day

» FaultTolerant DeadlineMonotonic Algorithm for Scheduling HardRealTime Tasks

» Characteristics of EDF Schedulability on Uniform Multiprocessors

» The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platfor...

» Analysis of Hierarchical EDF Preemptive Scheduling

» An Analysis of FixedPriority Schedulability on a Multiprocessor

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	RTSS
Authors	Theodore P. Baker

Comments (0)