1156 search results - page 42 / 232 » Optimal scheduling of task graphs on parallel systems |
100
click to vote
JSSPP
2010
Springer
14 years 9 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
84
Voted
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
IJHPCA
2006
14 years 11 months ago
2006
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
116
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...