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:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier Ltd
2016
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84937690973&doi=10.1016%2fj.compeleceng.2015.07.003&partnerID=40&md5=0ffad632cc31586f4c57dfabea695f12 http://eprints.utp.edu.my/25576/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|