An unfair semi-greedy real-time multiprocessor scheduling algorithm
Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule...
Saved in:
| Published in: | Computers & electrical engineering Vol. 50; pp. 143 - 165 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.02.2016
|
| Subjects: | |
| ISSN: | 0045-7906, 1879-0755 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!