Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Pre-emption
Ref: CISTER-TR-150107 Publication Date: May 2015
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Pre-emption
Ref: CISTER-TR-150107 Publication Date: May 2015Abstract:
This paper introduces schedulability analysis for global fixed priority scheduling with deferred preemption (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 using gFPDS via appropriate choice of priority assignment and final non-pre-emptive region lengths, and provide algorithms which optimize schedulability in this way. Via an experimental evaluation we compare the performance of multiprocessor scheduling using global approaches: gFPDS, gFPPS, and gFPNS, and also partitioned approaches employing FPDS, FPPS, and FPNS on each processor.
Robert Davis
Alan Burns
José Marinho
Vincent Nélis
Stefan M. PettersPublished in Transactions on Embedded Computing Systems - Special Issue on Embedded Platforms for Crypto and Regular Papers (TECS), ACM, Volume 14, Issue 3, Article No 47, pp 47:1-47:28.
U.S.A..
DOI:10.1145/2739954.
ISSN: 1539-9087.
Record Date: 30, Jan, 2015
Short links for this page: www.cister.isep.pt/docs/10_1145_2739954 www.cister.isep.pt/docs/cister_tr_150107 www.cister.isep.pt/docs/1051