327 search results - page 2 / 66 » Automatic Generation of DAG Parallelism |
IEEEPACT
1997
IEEE
13 years 10 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
CCGRID
2008
IEEE
13 years 8 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
EUROPAR
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
IPPS
2005
IEEE
2005
IEEE
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
13 years 12 months ago
We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a ...
HPDC
1994
IEEE
13 years 10 months ago
1994
IEEE