Virtual laxity driven scheduling algorithm for multiprocessor real-time systems

Araştırma sonucu: ???type-name???Konferans katkısıbilirkişi

Özet

An optimal real time scheduling algorithm has been presented in this paper for multiprocessor systems. It has been assumed that system consists of m identical processors and only contains periodic tasks with implicit deadlines. Despite most of the recent studies focus on the notion of fairness, the proposed algorithm improves average response time of the tasks and decreases the number of the context switches by reducing the fragmented execution of the tasks without any fairness constraints.

Orijinal dilİngilizce
Ana bilgisayar yayını başlığıProceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012
Sayfalar59-64
Sayfa sayısı6
Yayın durumuYayınlandı - 2012
Etkinlik5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012 - Istanbul, Turkey
Süre: 12 Eki 201214 Eki 2012

Yayın serisi

AdıProceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012
Ülke/BölgeTurkey
ŞehirIstanbul
Periyot12/10/1214/10/12

Parmak izi

Virtual laxity driven scheduling algorithm for multiprocessor real-time systems' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap