A dynamic online non preemptive soft real time scheduling algorithm - high deadline meeting rate /
This thesis presents a new algorithm in scheduling Soft Real Time Jobs by means of Dynamic Non Preemptive scheme, which is capable of maintaining excellent deadline meeting rate during normal System Load, while producing much better deadline meeting rate during overload.
Saved in:
| 主要作者: | |
|---|---|
| 企業作者: | |
| 格式: | Thesis 圖書 |
| 語言: | English |
| 出版: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| 主題: | |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This thesis presents a new algorithm in scheduling Soft Real Time Jobs by means of Dynamic Non Preemptive scheme, which is capable of maintaining excellent deadline meeting rate during normal System Load, while producing much better deadline meeting rate during overload. |
|---|---|
| 實物描述: | 179 pages illustrations 30 cm. |
| 參考書目: | Includes bibliographical references (pages 140-144). |