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:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Format: | Thesis Bog |
| Sprog: | English |
| Udgivet: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Fag: | |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
System Under Maintenance
Our Library Management System is currently under maintenance.
Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance: