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.
Сохранить в:
| Главный автор: | |
|---|---|
| Соавтор: | |
| Формат: | Диссертация |
| Язык: | English |
| Опубликовано: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Предметы: | |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Итог: | 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. |
|---|---|
| Объем: | 179 pages illustrations 30 cm. |
| Библиография: | Includes bibliographical references (pages 140-144). |