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.
Kaydedildi:
Yazar: | Zahereel Ishwar Abdul Khalib (Yazar) |
---|---|
Müşterek Yazar: | Universiti Malaysia Perlis |
Materyal Türü: | Tez Kitap |
Dil: | English |
Baskı/Yayın Bilgisi: |
Perlis, Malaysia
School of Computer and Communication Engineering
2013.
|
Konular: | |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Benzer Materyaller
-
A dynamic online non preemptive soft real time scheduling algorithm - high deadline meeting rate /
Yazar:: Zahereel Ishwar Abdul Khalib
Baskı/Yayın Bilgisi: (2013) -
Algorithms /
Yazar:: Dasgupta, Sanjoy
Baskı/Yayın Bilgisi: (2008) -
Design and analysis of algorithms/
Yazar:: Panneerselvam, R.
Baskı/Yayın Bilgisi: (2016) -
Fundamentals of algorithmics /
Yazar:: Brassard, Gilles
Baskı/Yayın Bilgisi: (1996) -
Algorithms
Yazar:: Dasgupta, Sanjoy
Baskı/Yayın Bilgisi: (2008)