Sciweavers

17 search results - page 2 / 4
» The Space of EDF Feasible Deadlines
Sort
View
ECRTS
2007
IEEE
13 years 11 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
ECRTS
2010
IEEE
13 years 5 months ago
Improved Tardiness Bounds for Global EDF
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
OPODIS
2007
13 years 6 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
RTS
2008
134views more  RTS 2008»
13 years 3 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
ECRTS
2010
IEEE
13 years 5 months ago
On Schedulability Analysis of Non-cyclic Generalized Multiframe Tasks
— The generalized multiframe (GMF) task has been proposed to model a task whose execution times, deadlines and minimum separation times are changed according to a specified patte...
Noel Tchidjo Moyo, Eric Nicollet, Frederic Lafaye,...