Real-Time Systems Computer Networks and Communications

A note on utilization bounds with short critical sections in real-time systems

Beccari, Giuseppe, Caselli, Stefano
Springer Nature · 2026-11-12 · DOI 10.1007/s11241-026-09461-3

Abstract

We show that, for periodic or sporadic tasks scheduled on a single processor under Rate-Monotonic, Deadline-Monotonic, or Earliest Deadline First algorithms and different resource access control protocols, the blocking times due to short critical sections do not need to be accounted for in schedulability tests based on utilization bounds. When blocking-unaware utilization bounds hold, tasks will remain guaranteed if the additional utilization or density due to blocking does not exceed the utilization or density of the blocking task. A suitable condition to qualify as a Short Critical Section (SCS), i.e., a critical section which can be ignored in blocking times computation, is provided for several resource access control protocols. The SCS condition is task-specific and determined solely by the parameters of the tasks accessing the resource.

Read at publisher →