Practical multiprocessor scheduling algorithms for efficient parallel processing
This paper describes practical optimization/ approximation algorithms for scheduling a set of partially ordered computational tasks onto a multiprocessor system so that the schedule length will be minimized. Since this problem belongs to the class of ''strong'' NP-hard problems, we must foreclose the possibility of constructing not only pseudopolynomial time optimization algorithms but also fully polynomial time approximation schemes unless P = NP. This paper proposes a heuristic algorithm named CP/MISF (critical path/most immediate successors first) and an optimization/approximation algorithm named DF/IHS (d thfirst/implicit heuristic search). DF/IHS is an excellent scheduling method which can reduce markedly space complexity and average computation time by combining the branch-and-bound method with CP/MISF; it allows us to solve very large scale problems with a few hundred tasks. Numerical examples are included to demonstrate the effectiveness of the proposed algorithms.
- Research Organization:
- Department of Electrical Engineering, Waseda University, Tokyo
- OSTI ID:
- 6364241
- Journal Information:
- IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-33:11; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system
Generalized multiprocessor scheduling for directed acylic graphs