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.
|
| Предмети: | |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Резюме: | 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). |