Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: Defying the high complexity using effective search techniques

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 1998, Pages 424-431

  Ahmad, Ishfaq ^a   Kwok, Yu Kwong ^b  

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

^b PURDUE UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; INFORMATION ANALYSIS; OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS;

MULTIPROCESSORS; OPTIMAL SCHEDULING; PARALLEL A; PARALLEL PROCESSING; STATE SPACE SEARCH; TASK GRAPH;

OPTIMIZATION;

EID: 84878660881     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1998.708514     Document Type: Conference Paper

References (18)

1. H.H. Ali and H. El-Rewini, "The Time Complexity of Scheduling Interval Orders with Communication is Polynomial," Parallel Processing Letters, vol. 3, no. 1, 1993, pp. 53-58.
2. P.C. Chang and Y.S. Jiang, "A State-Space Search Approach for Parallel Processor Scheduling Problems with Arbitrary Precedence Relations," European Journal of Operational Research, 77, 1994, pp. 208-223.
3. G.-H. Chen and J.-S. Yu, "A Branch-And-Bound-With-Underestimates Algorithm for the Task Assignment Problem with Precedence Constraint," Proc. Int'l Conf. Distributed Computing Systems, 1990, pp. 494-501.
4. H.-C. Chou and C.-P. Chung, "Optimal Multiprocessor Task Scheduling Using Dominance and Equivalence Relations," Computers Operations Research, 21 (4), 1994, pp. 463-475.
5. E.G. Coffman, Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.
6. R. Correa and A. Ferreira, "On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms," Parallel Processing Letters, vol. 5, no. 3, 1995, pp. 375-386.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.
8. R.M. Karp and Y. Zhang, "Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation," Journal of the ACM, vol. 40, no. 3, July 1993, pp. 765-789.
9. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. C-33, Nov. 1984, pp. 1023-1029.
10. W.H. Kohler and K. Steiglitz, "Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems," J. ACM, vol. 21, Jan. 1974, pp. 140-156.
11. V. Kumar, K. Ramesh, and V.N. Rao, "Parallel Best-First Search of State-Space Graphs: A Summary of Results," Proc. 7th Int'l Conf. Art. Intell. (AAAI'88), Aug. 1988, vol. 1, pp. 122-127.
12. Y.-K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs onto Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, May 1996, pp. 506-521.
13. -, "Efficient Scheduling of Arbitrary Task Graphs Using A Parallel Genetic Algorithm," Journal of Parallel and Distributed Computing, vol. 47, no. 1, Nov. 1997, pp. 58-77.
14. Y.-K. Kwok, I. Ahmad, and J. Gu, "FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors," Proc. 25th Int'l Conf. on Parallel Processing, Aug. 1996, vol. II, pp. 150-157.
15. N.R. Mahapatra and S. Dutt, "Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A∗ Graph Search," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 7, July 1997, pp. 738-756.
16. J. Pearl and J.H. Kim, "Studies in Semi-Admissible Heuristics," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. PAMI-4, no. 4, July 1982, pp. 392-399.
17. D.R. Smith, "Random Trees and the Analysis of Branch-and-Bound Procedures," Journal of the ACM, vol. 31, no. 1, Jan. 1984, pp. 163-188.
18. T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. on Parallel and Distributed Systems, vol. 5, no. 9, Sep. 1994, pp. 951-967.