ECRTS
2009
IEEE
13 years 9 months ago
2009
IEEE
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept o...
RTCSA
2005
IEEE
14 years 5 months ago
2005
IEEE
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...
RTCSA
2006
IEEE
14 years 5 months ago
2006
IEEE
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
RTAS
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that quali...
SODA
2010
ACM
14 years 8 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 ...