Sciweavers

15 search results - page 1 / 3
» Deadline Monotonic Scheduling on Uniform Multiprocessors
Sort
View
OPODIS
2008
13 years 11 months ago
Deadline Monotonic Scheduling on Uniform Multiprocessors
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
Sanjoy K. Baruah, Joël Goossens
IPPS
1997
IEEE
14 years 2 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
RTSS
2003
IEEE
14 years 3 months 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
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 4 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
ECRTS
2003
IEEE
14 years 3 months ago
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
Shelby Funk, Sanjoy K. Baruah