Return
Scheduling master-slave multiprocessor systems
DOI:10.1109/12.543712.png)
Abstract
En 中文
We define 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:
multiprocessor computers
scheduling
NP-hard problems
algorithms
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
Strain rate dependent nanostructure of hydrogels with reversible hydrophobic associations during uniaxial extension
Soft Matter
IF0
no more

