By the same authors

From the same journal

From the same journal

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

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

Links

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalACM Transactions in Embedded Computing Systems
DatePublished - May 2015
Issue number3
Volume14
Number of pages28
Pages (from-to)1-28
Original languageEnglish

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.

    Research areas

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

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations

York staff: edit these data