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.
Gardado en:
Autor Principal: | |
---|---|
Autor Corporativo: | |
Formato: | Thesis Libro |
Idioma: | English |
Publicado: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
Subjects: | |
Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
Summary: | 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. |
---|---|
Descrición Física: | 179 pages illustrations 30 cm. |
Bibliografía: | Includes bibliographical references (pages 140-144). |