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.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Körperschaft: | |
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| Beschreibung: | 179 pages illustrations 30 cm. |
| Bibliographie: | Includes bibliographical references (pages 140-144). |