246 search results - page 8 / 50 » An Efficient Dynamic Scheduling Algorithm For Multiprocessor... |
SODA
2010
ACM
14 years 5 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 ...
ICPP
2002
IEEE
14 years 24 days ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
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...
ICPP
2002
IEEE
14 years 24 days ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
RTSS
1999
IEEE
14 years 4 days ago
1999
IEEE
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...