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.
Sparad:
| Huvudupphovsman: | |
|---|---|
| Institutionell upphovsman: | |
| Materialtyp: | Lärdomsprov Bok |
| Språk: | English |
| Publicerad: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Ämnen: | |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|