Referenced Items are not available for this document.
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
Published in:
Computers, IEEE Transactions on
(Volume:45
,
Issue:
10
)
Date of Publication: Oct 1996
- Page(s):
- 1195 - 1199
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 5433466
- Digital Object Identifier :
- 10.1109/12.543712
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1996
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
