Paper Info
Title
Improved Cache-Related Preemption Delay Estimation For Fixed Preemption Point Scheduling
Abstract
Cache-Related Preemption Delays (CRPD) can significantly increase tasks' execution time in preemptive real-time scheduling, potentially jeopardising the system schedulability. In order to reduce the cumulative CRPD, Limited Preemptive Scheduling (LPS) has emerged as a scheduling approach which limits the maximum number of preemptions encountered by real-time tasks, thus decreasing CRPD compared to fully preemptive scheduling. Furthermore, an instance of LPS, called Fixed Preemption Point Scheduling (LP-FPP), defines the exact points where the preemptions are permitted within a task, which enables a more precise CRPD estimation. The majority of the research, in the domain of LP-FPP, estimates CRPD with pessimistic upper bounds, without considering the possible sources of over-approximation: (1) accounting for the infeasible preemption combinations, and (2) accounting for the infeasible cache block reloads. In this paper, we improve the analysis by accounting for those two cases towards a more precise estimation of the CRPD upper bounds. The evaluation of the approach on synthetic tasksets reveals a significant reduction of the pessimism in the calculation of the CRPD upper bounds, compared to the existing approaches.
Year
DOI
Venue
2018
10.1007/978-3-319-92432-8_6
RELIABLE SOFTWARE TECHNOLOGIES - ADA-EUROPE 2018
Keywords
Field
DocType
Real-time systems, CRPD analysis, WCET analysis, Limited Preemptive Scheduling, Fixed preemption point approach
Preemption,Scheduling (computing),Computer science,Cache,Parallel computing,Real-time computing,Execution time
Conference
Volume
ISSN
Citations 
10873
0302-9743
1
PageRank 
References 
Authors
0.35
14
3
Name
Order
Citations
PageRank
Filip Markovic121.42
Jan Carlson2494.68
Radu Dobrin316922.41