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.
Kaydedildi:
| Yazar: | |
|---|---|
| Müşterek Yazar: | |
| Materyal Türü: | Tez Kitap |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Konular: | |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
| Özet: | 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. |
|---|---|
| Fiziksel Özellikler: | 179 pages illustrations 30 cm. |
| Bibliyografya: | Includes bibliographical references (pages 140-144). |