Issue No. 10 - October (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.543712
<p><b>Abstract</b>—We define the master-slave multiprocessor scheduling model in which a master processor coordinates the activities of several slave processors. <it>O</it>(<it>n</it> log <it>n</it>) centralized, deterministic, batch-oriented algorithms are developed for some of the problems formulated. Some others are shown to be NP-hard.</p>
Multiprocessor computers, scheduling, NP-hard problems, algorithms.
S. Sahni, "Scheduling Master-Slave Multiprocessor Systems," in IEEE Transactions on Computers, vol. 45, no. , pp. 1195-1199, 1996.