Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

Robert I. Davis, Alan Burns, José Marinho, Vincent Nélis, Stefan M. Petters, Marko Bertogna

ACM Transactions on Embedded Computing Systems · 2015 · 24 citations · 38 references

DOIFull text

Open access

Concepts

Abstract

This article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed Priority Nonpreemptive Scheduling (gFPNS). We show how schedulability can be improved using gFPDS via appropriate choice of priority assignment and final nonpreemptive region lengths, and provide algorithms that 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.

References

38