69 search results - page 8 / 14 » Mixed-Criticality Scheduling of Sporadic Task Systems |
RTAS
2010
IEEE
13 years 9 months ago
2010
IEEE
—The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between process...
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 ...
OPODIS
2008
14 years 6 days ago
2008
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
ECRTS
2002
IEEE
14 years 3 months ago
2002
IEEE
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
DATE
2009
IEEE
14 years 5 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...