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.
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Tác giả của công ty: | |
| Định dạng: | Luận văn Sách |
| Ngôn ngữ: | English |
| Được phát hành: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
| Những chủ đề: | |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Tóm tắt: | 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. |
|---|---|
| Mô tả vật lý: | 179 pages illustrations 30 cm. |
| Thư mục: | Includes bibliographical references (pages 140-144). |