A Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems

2016/02/24 by Jian-Jia Chen, Chen, Jian-Jia, Wen-Hung Huang +3
Computer Science · #Data Structures and Algorithms (cs.DS) #Distributed systems and fault tolerance #Embedded Systems Design Techniques #FOS: Computer and information sciences #Real-Time Systems Scheduling #cs.DS

paper · pdf · doi:10.48550/arxiv.1602.07750

arxiv created 2016/02/24 · openalex publication_date 2016/02/24 · arxiv updated 2016/02/26 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

This report presents a proof to support the correctness of the schedulability test for self-suspending real-time task systems proposed by Jane W. S. Liu in her book titled "Real-Time Systems" (Pages 164-165). The same concept was also implicitly used by Rajkumar, Sha, and Lehoczky in RTSS 1988 (Page 267) for analyzing self-suspending behaviour due to synchronization protocols in multiprocessor systems.

Related

• A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems
• A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems
• On Schedulability Analysis of EDF Scheduling by Considering Suspension as Blocking
• Errata for Three Papers (2004-05) on Fixed-Priority Scheduling with Self-Suspensions
• Eliminating Timing Anomalies in Scheduling Periodic Segmented Self-Suspending Tasks with Release Jitter