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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 2020 IEEE 41st Real-Time Systems Symposium, RTSS 2020
PublisherInstitute of Electrical and Electronics Engineers
Pages115-127
Number of pages13
ISBN (Electronic)9781728183244
DOIs
Publication statusPublished - 22 Feb 2020

Keywords

  • global multiprocessor scheduling
  • real-time systems
  • response-time analysis
  • shared resources

Fingerprint

Dive into the research topics of 'Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks'. Together they form a unique fingerprint.

Cite this