Sciweavers

34 search results - page 1 / 7
» A Constant-Approximate Feasibility Test for Multiprocessor R...
Sort
View
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 7 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...
ECRTS
2006
IEEE
13 years 11 months ago
The Feasibility Analysis of Multiprocessor Real-Time Systems
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...
Sanjoy K. Baruah, Nathan Fisher
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 2 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
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 ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
ETFA
2006
IEEE
13 years 11 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
ISOLA
2010
Springer
13 years 3 months ago
Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns
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...
Alain Plantec, Frank Singhoff, Pierre Dissaux, J&e...