On multiprocessor task scheduling using efficient state space search approaches

Journal of Parallel and Distributed Computing

Volumn 65, Issue 12, 2005, Pages 1515-1532

  Kwok, Yu Kwong ^a,c,d,e   Ahmad, Ishfaq ^b,f  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b The University of Texas at Arlington   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d IEEE   (Japan)

^e ACM   (Hong Kong)

^f UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

Multiprocessors; Optimal scheduling; Parallel A; Parallel processing; State space search; Task graphs

Indexed keywords

MULTIPROCESSORS; OPTIMAL SCHEDULING; PARALLEL A; PARALLEL PROCESSING; STATE-SPACE APPROACH; TASK GRAPHS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; SCHEDULING; STATE SPACE METHODS;

MULTIPROCESSING SYSTEMS;

EID: 27844522261     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.05.028     Document Type: Article

References (29)

1. I. Ahmad, and Y.-K. Kwok On parallelizing the multiprocessor scheduling problem IEEE Trans. Parallel Distributed Systems 10 4 April 1999 414 432
2. V.H. Allan Software pipelining ACM Comput. Surveys 27 3 1995 367 432
3. S. Baskiyar, C. Dickinson, Scheduling Directed Acyclic Task Graphs on Heterogeneous Processors Using Task Duplication, Lecture Notes in Computer Science, vol. 2913, Springer, Berlin, 2003, pp. 259-267.
4. P.C. Chang, and Y.S. Jiang A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations European J. Oper. Res. 77 1994 208 223
5. G.-H. Chen, J.-S. Yu, A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint, Proceedings of the International Conference on Distributed Computing Systems, 1990, pp. 494-501.
6. H.-C. Chou, and C.-P. Chung Optimal multiprocessor task scheduling using dominance and equivalence relations Comput. Oper. Res. 21 4 1994 463 475
7. R. Correa, and A. Ferreira On the effectiveness of synchronous parallel branch-and-bound algorithms Parallel Process. Lett. 5 3 1995 375 386
8. P. Chretienne et al. (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995.
9. A. Darte Scheduling and Automatic Parallelization 2000 Birkhauser Basel
10. J. Eckstein Parallel branch-and-bound methods for mixed integer programming on the CM-5 SIAM J. Optim. 4 4 1994 794 814
11. H. El-Rewini, T.G. Lewis, and H.H. Ali Task Scheduling in Parallel and Distributed Systems 1994 Prentice-Hall Englewood Cliffs, NJ
12. H. El-Rewini Task scheduling in multiprocessor systems Computer 28 12 1995 27 37
13. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP Completeness 1979 W.H. Freeman and Company New York
14. A. Grama, and V. Kumar State of the art in parallel search techniques for discrete optimization problems IEEE Trans. Knowledge Data Eng. 11 1 January-February 1999 28 35
15. C.-J. Hou, and K.G. Shin Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems IEEE Trans. Comput. 46 12 December 1997 1338 1356
16. G. Karypis, and V. Kumar Unstructured tree search on SIMD parallel computers IEEE Trans. Parallel Distributed Systems 5 10 October 1994
17. V. Kumar, and L.N. Kanal A general branch-and-bound formulations for understanding and synthesizing and/or tree search procedures Artif. Intell. 21 1983 179 198
18. V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Algorithm Design and Analysis, Benjamin/Cummings, Menlo Park, CA, Addison-Wesley, Reading, MA, 1994.
19. V. Kumar, K. Ramesh, V.N. Rao, Parallel best-first search of state-space graphs: a summary of results, Proceedings of the Seventh International Conference on Artificial Intelligence (AAAI'88), vol. 1, August 1988, pp. 122-127.
20. Y.-K. Kwok, and I. Ahmad Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Comput. Surveys 31 4 December 1999 406 471
21. Y.-K. Kwok, and I. Ahmad Benchmarking comparison of the task graph scheduling algorithms J. Parallel Distributed Comput. 59 3 December 1999 381 422
22. T.H. Lai, and S. Sahni Anomalies in parallel branch and bound algorithms Comm. ACM 1984 594 602
23. N.R. Mahapatra, and S. Dutt Scalable global and local hashing strategies for duplicate pruning in parallel A * graph search IEEE Trans. Parallel Distributed Systems 8 7 July 1997 738 756
24. J. Pearl, and J.H. Kim Studies in semi-admissible heuristics IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 4 July 1982 392 399
25. C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez Optimal scheduling strategies in a multiprocessor system IEEE Trans. Comput. C-21 February 1972 137 146
26. D.R. Smith Random trees and the analysis of branch-and-bound procedures J. ACM 31 1 January 1984 163 188
27. H. Topcuoglu, S. Hariri, and M.-Y. Wu Performance-effective and low-complexity task scheduling for heterogeneous computing parallel and distributed systems IEEE Trans. Parallel Distributed Systems 13 3 March 2002
28. W. Zhang State Space Search: Algorithms Complexity, Extensions, and Applications 1999 Springer Berlin
29. A.Y. Zomaya, C. Ward, and B. Macey Genetic scheduling for parallel processor systems: comparative studies and performance issues IEEE Trans. Parallel Distributed Systems 10 8 August 1999 795 812