Virtual laxity driven scheduling algorithm for multiprocessor real-time systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012
Pages59-64
Number of pages6
Publication statusPublished - 2012
Event5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012 - Istanbul, Turkey
Duration: 12 Oct 201214 Oct 2012

Publication series

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

Conference

Conference5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012
Country/TerritoryTurkey
CityIstanbul
Period12/10/1214/10/12

Fingerprint

Dive into the research topics of 'Virtual laxity driven scheduling algorithm for multiprocessor real-time systems'. Together they form a unique fingerprint.

Cite this