The Community for Technology Leaders
RSS Icon
Issue No.11 - November (1984 vol.33)
pp: 1023-1029
H. Kasahara , Department of Electrical Engineering, Waseda University
task graph, 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., Approximation, branch-and-bound method, heuristic algorithm, MIMD system, multiprocessor scheduling algorithm, optimization, parallel processing, strong NP-hard
H. Kasahara, S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing", IEEE Transactions on Computers, vol.33, no. 11, pp. 1023-1029, November 1984, doi:10.1109/TC.1984.1676376
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool