A dynamic online non preemptive soft real time scheduling algorithm – high deadline meeting rate
The evergreen Earliest Deadline First algorithm is an excellent dynamic real time job scheduler under normal System Load. However, its’ performance in terms of deadline meeting rate is simply undeterministic under overload condition. This thesis presents a new algorithm in scheduling Soft Real Time...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 主题: | |
| 在线阅读: | http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/33154/1/Page%201-24.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/33154/2/Full%20text.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|