A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays

A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays

In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP) and earliest deadline first (EDF). While they have b...

Full description

Bibliographic Details
Main Authors: Lunniss, Will, Altmeyer, Sebastian, Davis, Robert I.
Format: Article
Language:English
Published: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik 2014-04-01
Series:Leibniz Transactions on Embedded Systems
Subjects:
real-time systems
fixed priority
edf
pre-emptive scheduling
cache related pre-emption delays
Online Access:https://drops.dagstuhl.de/storage/07lites/lites_vol001/lites_vol001_issue001/LITES-v001-i001-a001/LITES-v001-i001-a001.pdf

Internet

https://drops.dagstuhl.de/storage/07lites/lites_vol001/lites_vol001_issue001/LITES-v001-i001-a001/LITES-v001-i001-a001.pdf

Similar Items