36 search results - page 4 / 8 » EDF-schedulability of synchronous periodic task systems is c... |
90
Voted
SODA
2010
ACM
15 years 6 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 ...
115
Voted
ETFA
2006
IEEE
15 years 3 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...
ICONS
2009
IEEE
14 years 7 months ago
2009
IEEE
The aim of this paper is to address the problem of correctly dimensioning real-time embedded systems. It is well known that computers which control systems are greatly affected by...
DATE
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties ...
81
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most kn...