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.

@article{ 10.1109/TC.1984.1676376,
author = {H. Kasahara and S. Narita},
title = {Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing},
journal ={IEEE Transactions on Computers},
volume = {33},
number = {11},
issn = {0018-9340},
year = {1984},
pages = {1023-1029},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676376},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

TY - JOUR
JO - IEEE Transactions on Computers
TI - Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IS - 11
SN - 0018-9340
SP1023
EP1029
EPD - 1023-1029
A1 - H. Kasahara,
A1 - S. Narita,
PY - 1984
KW - task graph
KW - 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
KW - we must foreclose the possibility of constructing not only pseudopolynomial time optimization algorithms but also fully polynomial time approximation schemes unless P = NP.
KW - Approximation
KW - branch-and-bound method
KW - heuristic algorithm
KW - MIMD system
KW - multiprocessor scheduling algorithm
KW - optimization
KW - parallel processing
KW - strong NP-hard
VL - 33
JA - IEEE Transactions on Computers
ER -