Document details

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Pre-emption

Author(s): Davis, Robert I. ; Burns, Alan ; Marinho, José ; Nelis, Vincent ; Petters, Stefan M. ; Bertogna, Marko

Date: 2015

Persistent ID: http://hdl.handle.net/10400.22/6716

Origin: Repositório Científico do Instituto Politécnico do Porto

Subject(s): Real-Time and Embedded Systems; Algorithms; Performance; Theory; Verification; Deferred preemption; Limited preemption; Global scheduling; Partitioned scheduling; Fixed priority; Real-time; Multiprocessor; Multicore; Real-Time and Embedded Systems; Real-Time and Embedded Systems; Algorithms; Algorithms; Performance; Performance; Theory; Theory; Verification; Verification; Deferred preemption; Deferred preemption; Limited preemption; Limited preemption; Global scheduling; Global scheduling; Partitioned scheduling; Partitioned scheduling; Fixed priority; Fixed priority; Real-time; Real-time; Multiprocessor; Multiprocessor; Multicore; Multicore


Description

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

Document Type Journal article
Language English
Contributor(s) REPOSITÓRIO P.PORTO
facebook logo  linkedin logo  twitter logo 
mendeley logo

Related documents

No related documents