Automatic parallelization techniques based on compact dag extraction and symbolic scheduling

Parallel Processing Letters

Volumn 11, Issue 1, 2001, Pages 151-168

  Cosnard, M ^a   Jeannot, E ^a  

^a LORIA   (France)

Author keywords

Clustering; Coarse grain parallelism; Dynamic scheduling; Parameterized task graphs; Symbolic allocation

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING;

AUTOMATIC PARALLELIZATION TECHNIQUES; COARSE GRAIN PARALLELISM; COMPACT DAG EXTRACTION; PARAMETERIZED TASK GRAPHS; SYMBOLIC ALLOCATION; SYMBOLIC LINEAR CLUSTERING; SYMBOLIC SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0035266229     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s012962640100049x     Document Type: Article

References (39)

1. Automatic parallelization and scheduling on multiprocessors using CASCH
2. The SUIF compiler for scalable parallel machines
3. Global optimizations for parallelism and locality on scalable parallel machines
4. Provably efficient scheduling for languages with fine-grained parallelism
5. Cilk: An efficient multithreaded runtime system
6. Multiprocessor runtime support for fine-grained irregular DAGs
7. Compact DAG representation and its dynamic scheduling
8. Low memory cost dynamic scheduling of large coarse grain task graphs
9. SLC: Symbolic scheduling for executing parameterized task graphs on multiprocessors
10. Automatic task graph generation techniques
11. A simple algorithm for the generation of efficient loop structures
12. On the allignment problem
13. POEMS: End-to-end performance design of large parallel adaptive computational systems
14. Mapping affine loop nests: New results
15. Athapascan 1b: Présentation
16. Scheduling parallel programs onto arbitrary target machines
17. Dataflow analysis of array and scalar references
18. Toward automatic distribution
19. Distribution automatique des donnes et des calculs
20. Sparse LU factorization with partial pivoting on distributed memory machines
21. Space and time efficient execution of parallel irregular computations
22. Scheduling of structured and unstructured computation
23. On the granularity and clustering of direct acyclic task graphs
24. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
25. A new heuristic for scheduling parallel programs on multiprocessor
26. Affine dependence classification for communications minimization
27. Task clustering and scheduling for distributed memory parallel architectures
28. Toward an architecture independent analysis of parallel algorithms
29. The omega test a fast and practical integer programming algorithm for dependence analysis
30. How "Hard" is thread partitioning and how "Bad" is a list scheduling based partitioning algorithm?
31. Runtime parallel incremental scheduling of DAGs
32. Pyrros: Static task scheduling and code generation for message passing multiprocessor
33. DSC scheduling parallel tasks on an unbounded number of processors