A comprehensive test bench for the evaluation of scheduling heuristics

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn 16, Issue , 2004, Pages 437-442

  Honig, Udo ^a   Schiffmann, Wolfram ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Optimal Schedules; Task Graph Scheduling; Test Bench

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA REDUCTION; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

OPTIMAL SCHEDULING; SCHEDULING HEURISTICS; TASK GRAPH SCHEDULING; TEST BENCH;

HEURISTIC METHODS;

EID: 11844275941     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. G.G. Sih, E.A. Lee, A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures, IEEE Transactions on Parallel and Distributed Systems, 4(2), 1993, 75-87
2. J.J. Hwang, Y.C. Chow, F.D. Anger, C.Y. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, 18(2), 1989, 244-257
3. T.L. Adam, K.M. Chandy, J. Dickson, A comparison of List Scheduling for Parallel Processing Systems, Communications of the ACM, Vol. 17, 1974, 685-690
4. M.-Y. Wu, D.D. Gayski, Hypertool: A Programming Aid for Message-Passing Systems, IEEE Transactions on Parallel and Distributed Systems, 1(3), 1990, 330-343
5. E. Bampis (ed.), Special Issue: Task scheduling problems for parallel and distributed systems, Parallel computing, 25(1), 1999
6. M.-Y. Wu, W. Shu, J. Gu, Efficient Local Search for DAG Scheduling, IEEE Transactions on Parallel and Distributed Systems, 2001, 617-627
7. S. Bansal, P. Kumar, K. Singh, An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems, IEEE Transaction on Parallel and Distributed Systems, 14(6), 2003
8. E.G. Coffman (ed.), Computer and Job-Shop Scheduling Theory (New York, John Wiley & Sons, 1976)
9. U. Honig, W. Schiffmann, A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules, Proceedings of the Second International Workshop on Grid and Cooperative Computing, Shanghai, China, 2003, 747-755
10. U. Hönig, W. Schiffmann, Fast optimal task graph scheduling by means of an optimized parallel A*Algorithm, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. II, Las Vegas, U.S.A., 2004, 842-848
11. Kasahara Laboratory, http://www.kasahara.elec. waseda.ac.jp/schedule/ index.html, 2004
12. Y.-K. Kwok, I. Ahmad, Benchmarking the Task Graph Scheduling Algorithms, Proceedings of the 12th International Parallel Processing Symposium, Orlando, U.S.A., 1998, 531-537
13. Y.-K. Kwok, I. Ahmad, Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, ACM Computing Surveys, 31(4), 1999, 406-471