Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks

Conference paper (2020)

Authors

Suhail Nogd Student
Geoffrey Nelissen Eindhoven University of Technology
Mitra Nasri Embedded Systems, Eindhoven University of Technology
Björn B. Brandenburg Max Planck Institute for Software Systems
Research Group
Embedded Systems
More Info
expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Embedded Systems

Abstract

Motivated by the lack of response-time analyses for non-preemptive global scheduling that consider shared resources, this paper provides such an analysis for global job-level fixed-priority (JLFP) scheduling policies and FIFO-ordered spin locks. The proposed analysis computes response-time bounds for a set of resource-sharing jobs subject to release jitter and execution-time uncertainties by implicitly exploring all possible execution scenarios using state-abstraction and state-pruning techniques. A large-scale empirical evaluation of the proposed analysis shows it to be substantially less pessimistic than simple execution-time inflation methods, thanks to the explicit modeling of contention for shared resources and scenario-aware blocking analysis.

Files

Response-Time_Analysis_for_Non... (pdf)
(pdf | 1.44 Mb)
- Embargo expired in 26-02-2025
Unknown license