Sciweavers

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

37

OPODIS
2008

favoriteEmaildiscussreport

181views Distributed And Parallel Com...» more OPODIS 2008»

Deadline Monotonic Scheduling on Uniform Multiprocessors

13 years 10 months ago

Deadline Monotonic Scheduling on Uniform Multiprocessors

Download dev.ulb.ac.be

The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

Sanjoy K. Baruah, Joël Goossens

Real-time Traffic

Distributed And Parallel Computing | Non-trivial Quantitative Guarantees | OPODIS 2008 | Sufficient Schedulability Test | Uniform Multiprocessor Platforms |

claim paper

Related Content

» FaultTolerant DeadlineMonotonic Algorithm for Scheduling HardRealTime Tasks

» Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

» An AverageCase Analysis for RateMonotonic Multiprocessor RealTime Scheduling

» Characteristics of EDF Schedulability on Uniform Multiprocessors

» Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors

» On NonUtilization Bounds for Arbitrary Fixed Priority Policies

» Portioned staticpriority scheduling on multiprocessors

» An Analysis of FixedPriority Schedulability on a Multiprocessor

» Improved priority assignment for global fixed priority preemptive scheduling in multiproce...

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	OPODIS
Authors	Sanjoy K. Baruah, Joël Goossens

Comments (0)