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.
שמור ב:
| מחבר ראשי: | |
|---|---|
| מחבר תאגידי: | |
| פורמט: | Thesis ספר |
| שפה: | 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). |