Analysis of job scheduling algorithms for heterogeneous multiprocessor computing systems
The problem of scheduling independent jobs on heterogeneous multiprocessor models (i.e., those with non-identical or uniform processors) with independent memories has been studied. Actually, a number of demand scheduling nonpreemptive algorithms have been evaluated, with respect to their mean flow a...
| Main Author: | |
|---|---|
| Published: |
Loughborough University
1979
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.473585 |