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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Default Thesis |
| Published: |
1979
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/7946 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|