Min-to-Max-Weight Fair Scheduling Algorithm on Multiprocessors
碩士 === 國立清華大學 === 資訊工程學系 === 94 === Relate a task to a weight = (E/P), where E is its required execution during its period length P. Min-to-Max-Weight Fairness is a fair scheduling issue on multiprocessors, defining each task’s execution as a value within a specified range (implied by its minimum we...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60849331089864179084 |