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). |