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

被引：7

作者：

Nogd, Suhail ^{[1
]}

Nelissen, Geoffrey ^{[2
]}

Nasri, Mitra ^{[2
]}

Brandenburg, Bjoern B. ^{[3
]}

机构：

[1] Delft Univ Technol TUDelft, Delft, Netherlands

[2] Eindhoven Univ Technol TU E, Eindhoven, Netherlands

[3] Max Planck Inst Software Syst MPI SWS, Saarbrucken, Germany

来源：

2020 IEEE 41ST REAL-TIME SYSTEMS SYMPOSIUM (RTSS) | 2020年

关键词：

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

D O I：

10.1109/RTSS49844.2020.00021

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：115 / 127

页数：13