List scheduling with and without communication delays

Parallel Computing

Volumn 19, Issue 12, 1993, Pages 1321-1344

  Yang, Tao ^a   Gerasoulis, Apostolos ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

critical path heuristic; experimental study; List scheduling; nCUBE 2; processor scheduling problem; ready list scheduling heuristics; task execution

Indexed keywords

CRITICAL PATH ANALYSIS; MULTIPROCESSING SYSTEMS; SCHEDULING; SUPERCOMPUTERS;

LIST SCHEDULING; PROCESSOR SCHEDULING; TASK EXECUTION;

PARALLEL PROCESSING SYSTEMS;

EID: 0027841407     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(93)90079-Z     Document Type: Article

References (26)

1. A comparison of list schedules for parallel processing Systems
2. Experience with an automatic solution to the mapping problem
3. On the mapping problem
4. Optimal scheduling for two-processors systems
5. Parallel Gaussian elimination on an MIMD computer
6. Performance of the INTEL iPSC/860 and nCUBE 6400 Hypercube,
7. Scheduling parallel program tasks onto arbitrary target machines
8. Static scheduling for linear algebra DAGs
9. Clustering task graphs for message passing architectures
10. A Comparison of clustering heuristics for scheduling DAGs on multiprocessors
11. A static macro-dataflow scheduling tool for scalable parallel architectures
12. Bounds for certain multiprocessing anomalies
13. Complexity of scheduling multiprocessor tasks with prespecified processor allocations
14. Parallel sequencing and assembly lines problems
15. Practical Multi-processor scheduling algorithms for efficient parallel processing
16. A general approach to mapping of parallel computation upon multiprocessor architectures
17. Static task scheduling and grain packing in parallel processing systems
18. OREGAMI: software tools for mapping parallel computations to parallel architectures
19. Runtime resource management in concurrent systems
20. A programming aid for hypercube architectures
21. A mapping strategy for MIMD computers
22. A fast static scheduling algorithm for DAGs on an unbounded number of processors
23. PYRROS: Static task scheduling and code generation for message passing multiprocessors