309 search results - page 7 / 62 » The Partitioned Multiprocessor Scheduling of Sporadic Task S... |
SODA
2010
ACM
14 years 4 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 ...
RTCSA
2000
IEEE
13 years 11 months ago
2000
IEEE
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
ECRTS
2008
IEEE
14 years 1 months ago
2008
IEEE
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fi...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...