1156 search results - page 60 / 232 » Optimal scheduling of task graphs on parallel systems |
89
Voted
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
110
click to vote
RTCSA
1999
IEEE
15 years 4 months ago
1999
IEEE
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is presented in this paper. The protocol gives the means to concurrent real-time tasks...
105
click to vote
JPDC
2010
14 years 10 months ago
2010
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...
IV
2009
IEEE
15 years 6 months ago
2009
IEEE
Visualisation and structuring of tasks in a schedule, from relatively simple activities such as meeting scheduling to more complex ones such as project planning, has been traditio...
RTAS
2002
IEEE
15 years 4 months ago
2002
IEEE
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...