Global Fixed Priority Scheduling with Deferred Pre-emption
R.I. Davis, A. Burns, J. Marinho, V. Nelis, S.M. Petters and M. Bertogna
This paper introduces schedulability analysis for global fixed priority scheduling with deferred pre-emption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved via appropriate choice of priority assignment and final non-pre-emptive region lengths, and we provide algorithms which optimize schedulability in this way. An experimental evaluation shows that gFPDS significantly outperforms both gFPPS and gFPNS.
BibTex Entry
@inproceedings{Davis2013c,
author = {R.I. Davis and A. Burns and J. Marinho and V. Nelis and S.M. Petters and M. Bertogna},
booktitle = {IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)},
month = {Aug},
title = {Global Fixed Priority Scheduling with Deferred Pre-emption},
year = {2013}
}