Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

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

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Article number47
Pages (from-to)1-28
Number of pages28
JournalACM Transactions in Embedded Computing Systems
Issue number3
Publication statusPublished - May 2015


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

Cite this