Sciweavers

34 search results - page 6 / 7
» A Constant-Approximate Feasibility Test for Multiprocessor R...
Sort
View
RTAS
2010
IEEE
13 years 3 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
RTAS
2006
IEEE
13 years 11 months ago
Adaptive Allocation of Software and Hardware Real-Time Tasks for FPGA-based Embedded Systems
Operating systems for reconfigurable devices enable the development of embedded systems where software tasks, running on a CPU, can coexist with hardware tasks running on a recon...
Rodolfo Pellizzoni, Marco Caccamo
RTAS
2008
IEEE
13 years 11 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
IESS
2007
Springer
110views Hardware» more  IESS 2007»
13 years 11 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
ECRTS
2003
IEEE
13 years 10 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