34 search results - page 1 / 7 » A Constant-Approximate Feasibility Test for Multiprocessor R... |
ESA
2008
Springer
13 years 6 months ago
2008
Springer
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...
ECRTS
2006
IEEE
13 years 10 months ago
2006
IEEE
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for determining whether a given collection of jobs can be scheduled to m...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
ETFA
2006
IEEE
13 years 10 months ago
2006
IEEE
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...
ISOLA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...