1156 search results - page 108 / 232 » Optimal scheduling of task graphs on parallel systems |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
SBACPAD
2005
IEEE
15 years 5 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
121
click to vote
HPDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multidisciplinary expertise and large-scale computational experiments. The...
107
click to vote
HPCA
2002
IEEE
15 years 4 months ago
2002
IEEE
Configurations of contemporary DRAM memory systems become increasingly complex. A recent study [5] shows that application performance is highly sensitive to choices of configura...
ICST
2008
IEEE
15 years 6 months ago
2008
IEEE
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...