Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

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

doi:10.1145/2739954

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

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

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Article number	47
Pages (from-to)	1-28
Number of pages	28
Journal	ACM Transactions in Embedded Computing Systems
Volume	14
Issue number	3
DOIs	https://doi.org/10.1145/2739954
Publication status	Published - May 2015

Keywords

Deferred preemption
real-time
partitioned scheduling
multiprocessor
limited preemption
global scheduling
fixed priority

Access to Document

10.1145/2739954

Robert Ian Davis
- rob.davisyork.acuk
- Computer Science - Senior Research Fellow - Reader
Person: Research

Cite this

@article{b676df96c26547e587c2a4d065ca99bd,

title = "Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption",

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

keywords = "Deferred preemption, real-time, partitioned scheduling, multiprocessor, limited preemption, global scheduling, fixed priority",

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

year = "2015",

month = may,

doi = "10.1145/2739954",

language = "English",

volume = "14",

pages = "1--28",

journal = "ACM Transactions in Embedded Computing Systems",

issn = "1539-9087",

publisher = "ACM",

number = "3",

}

TY - JOUR

T1 - Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

AU - Davis, Robert Ian

AU - Burns, Alan

AU - Marinho, Jose

AU - Nelis, Vincent

AU - Petters, Stefan

AU - Bertogna, Marko

PY - 2015/5

Y1 - 2015/5

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

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

KW - Deferred preemption

KW - real-time

KW - partitioned scheduling

KW - multiprocessor

KW - limited preemption

KW - global scheduling

KW - fixed priority

U2 - 10.1145/2739954

DO - 10.1145/2739954

M3 - Article

SN - 1539-9087

VL - 14

SP - 1

EP - 28

JO - ACM Transactions in Embedded Computing Systems

JF - ACM Transactions in Embedded Computing Systems

IS - 3

M1 - 47

ER -

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

Abstract

Keywords

Access to Document

Profiles

Robert Ian Davis

Cite this