Efficient local search for DAG scheduling

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 6, 2001, Pages 617-627

  Wu, Min You ^a,b   Shu, Wei ^a,b   Gu, Jun ^a,c  

^a IEEE   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Complexity; DAG scheduling; Fast local search; Multiprocessors; Quality

Indexed keywords

DIRECT ACRYCLIC GRAPHS (DAG);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0035363265     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.932715     Document Type: Article

References (26)

1. A comparison of list scheduling for parallel processing systems
2. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
3. Scheduling parallel program tasks onto arbitrary target machines
4. Optimization and approximation in deterministic sequencing and scheduling: A survey
5. Efficient local search for very large-scale satisfiability problem
6. Average time complexities of several local search algorithms for the satisfiability problem
7. Local search for satisfiability (SAT) problem
8. Parallel sequencing and assembly line problems
9. A comparison of multiprocessor scheduling heuristics
10. Grain size determination for parallel processing
11. FAST: A low-complexity algorithm for efficient scheduling of DAGs on parallel processors
12. FASTEST: A practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors
13. Microword length minimization in microprogrammed controller synthesis
14. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
15. Fast search algorithms for the n-Queens problem
16. Efficient local search with conflict minimation
17. Hypertool: A programming aid for message-passing systems
18. DSC: Scheduling parallel tasks on an unbounded number of processors
19. PYRROS: Static task scheduling and code generation for message-passing multiprocessors