مرکز منطقه ای اطلاع رساني علوم و فناوري - Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

Keywords :

Approximation; MIMD system; 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.; branch-and-bound method; heuristic algorithm; multiprocessor scheduling algorithm; optimization; parallel processing; strong NP-hard; task graph; Approximation algorithms; Concurrent computing; Heuristic algorithms; Large-scale systems; Multiprocessing systems; NP-hard problem; Parallel processing; Polynomials; Processor scheduling; Scheduling algorithm; Approximation; MIMD system; 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.; branch-and-bound method; heuristic algorithm; multiprocessor scheduling algorithm; optimization; parallel processing; strong NP-hard; task graph;