Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

MIMD (multiple instruction stream, multiple data stream) parallel processing systems or multiprocessor systems have been employed in a wide variety of computer applications. In order to take advantage of the prospects of parallel processing, an efficient scheduling algorithm must be developed. Such...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník C-33; číslo 11; s. 1023 - 1029
Hlavní autoři:	KASAHARA, H, NARITA, S
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.11.1984 Institute of Electrical and Electronics Engineers
Témata:	Accuracy Applied sciences Approximation Approximation algorithms branch-and-bound method Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology heuristic algorithm Heuristic algorithms Lower bound MIMD system multiprocessor scheduling algorithm optimization parallel processing Processor scheduling Program processors Schedules Scheduling algorithms Software Sorting strong NP-hard 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 Time complexity we must foreclose the possibility of constructing not only pseudopolynomial time optimization algorithms but also fully polynomial time approximation schemes unless P = NP Multiprocessor Approximation Branch and bound method Integrated planning Heuristic method Task scheduling Parallel processing Algorithm Optimization
ISSN:	0018-9340, 1557-9956
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!