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.
5th Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA 2012)
Congress
2012 Global Congress on Communications, Computers and Applications (GC-CCA 2012), 12-14 October 2012, Istanbul, Turkey
Pages
63-68
Topics
Real-Time Scheduling Real-Time Systems
ISSN
2227-331X
DOI
BibTeX
@inproceedings{441CCA2012,
title={Virtual Laxity Driven Scheduling for Multiprocessor Real-Time Systems},
author={Gökhan Seçinti, and Turgay Altilar},
booktitle={2012 Global Congress on Communications, Computers and Applications (GC-CCA 2012)},
year={2012},
pages={63-68},
doi={}},
organization={Mosharaka for Research and Studies}
}