104 search results - page 4 / 21 » Parallel processor scheduling with delay constraints |
HPCA
1995
IEEE
14 years 2 months ago
1995
IEEE
The throughput of a multiple-pipelined processor suffers due to lack of sufficient instructions to make multiple pipelines busy and due to delays associated with pipeline depende...
JSSPP
2010
Springer
13 years 8 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 ...
ICMCS
2007
IEEE
14 years 5 months ago
2007
IEEE
The H.264 decoder has a sequential, control intensive front end that makes it difficult to leverage the potential performance of emerging manycore processors. Preparsing is a fun...
JPDC
2006
13 years 10 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
CLUSTER
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...