1156 search results - page 42 / 232 » Optimal scheduling of task graphs on parallel systems |
134
Voted
JSSPP
2010
Springer
15 years 1 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 ...
114
click to vote
DATE
2010
IEEE
15 years 8 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...
127
Voted
IPPS
2009
IEEE
15 years 10 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 ...
102
Voted
IJHPCA
2006
15 years 3 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...
153
Voted
CORR
2010
Springer
15 years 1 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...