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

S. Nogd, G. Nelissen, M. Nasri, B.B. Brandenburg

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)


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.

Originele taal-2Engels
TitelProceedings - 2020 IEEE 41st Real-Time Systems Symposium, RTSS 2020
UitgeverijInstitute of Electrical and Electronics Engineers
Aantal pagina's13
ISBN van elektronische versie9781728183244
StatusGepubliceerd - 22 feb 2020


Duik in de onderzoeksthema's van 'Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks'. Samen vormen ze een unieke vingerafdruk.

Citeer dit