Title :
Scheduling master-slave multiprocessor systems
Author_Institution :
Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
fDate :
10/1/1996 12:00:00 AM
Abstract :
The author defines the master-slave multiprocessor scheduling model in which a master processor coordinates the activities of several slave processors. O(n log n) centralized, deterministic, batch-oriented algorithms are developed for some of the problems formulated. Some others are shown to be NP-hard
Keywords :
batch processing (computers); computational complexity; deterministic algorithms; multiprocessing systems; parallel algorithms; parallel machines; processor scheduling; satellite computers; NP-hard problems; O(n log n) centralized deterministic batch-oriented algorithms; master processor; master-slave multiprocessor scheduling model; slave processor activity coordination; Concurrent computing; Hypercubes; Job shop scheduling; Master-slave; Multiprocessing systems; NP-hard problem; Processor scheduling; Scheduling algorithm; Yarn;
Journal_Title :
Computers, IEEE Transactions on
