Sciweavers

2 search results - page 1 / 1
» Feasibility Intervals for Fixed-Priority Real-Time Schedulin...
Sort
View
ETFA
2006
IEEE
13 years 10 months ago
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are wellknown for uni...
Liliana Cucu, Joël Goossens
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 6 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...