Global Fixed Priority Scheduling with Deferred Pre-emption

Robert Ian Davis; Alan Burns; Jose Marinho; Vincent  Nelis; Stefan Petters; Marko Bertogna

doi:10.1109/RTCSA.2013.6732198

Global Fixed Priority Scheduling with Deferred Pre-emption

Robert Ian Davis, Alan Burns, Jose Marinho, Vincent Nelis, Stefan Petters, Marko Bertogna

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)
Pages	1-11
DOIs	https://doi.org/10.1109/RTCSA.2013.6732198
Publication status	Published - 1 Aug 2013
Event	Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013 IEEE 19th International Conference - Taipei, Taiwan Duration: 19 Aug 2013 → 21 Aug 2013

Conference

Conference	Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013 IEEE 19th International Conference
Country/Territory	Taiwan
City	Taipei
Period	19/08/13 → 21/08/13

Access to Document

10.1109/RTCSA.2013.6732198

Cite this

@inproceedings{7062e1683e3e4bf5aa1d53c90fdf61fb,

title = "Global Fixed Priority Scheduling with Deferred Pre-emption",

abstract = "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.",

author = "Davis, {Robert Ian} and Alan Burns and Jose Marinho and Vincent Nelis and Stefan Petters and Marko Bertogna",

year = "2013",

month = aug,

day = "1",

doi = "10.1109/RTCSA.2013.6732198",

language = "English",

pages = "1--11",

booktitle = "IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)",

note = "Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013 IEEE 19th International Conference ; Conference date: 19-08-2013 Through 21-08-2013",

}

Davis, RI , Burns, A, Marinho, J, Nelis, V, Petters, S & Bertogna, M 2013, Global Fixed Priority Scheduling with Deferred Pre-emption. in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). pp. 1-11, Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013 IEEE 19th International Conference , Taipei, Taiwan, 19/08/13. https://doi.org/10.1109/RTCSA.2013.6732198

TY - GEN

T1 - Global Fixed Priority Scheduling with Deferred Pre-emption

AU - Davis, Robert Ian

AU - Burns, Alan

AU - Marinho, Jose

AU - Nelis, Vincent

AU - Petters, Stefan

AU - Bertogna, Marko

PY - 2013/8/1

Y1 - 2013/8/1

N2 - 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.

AB - 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.

U2 - 10.1109/RTCSA.2013.6732198

DO - 10.1109/RTCSA.2013.6732198

M3 - Conference contribution

SP - 1

EP - 11

BT - IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

T2 - Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013 IEEE 19th International Conference

Y2 - 19 August 2013 through 21 August 2013

ER -