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:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Subjects: | |
| Online Access: | 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|