The SRP Resource Sharing Protocol for Self-Suspending Tasks

Nelissen, Geoffrey; Biondi, Alessandro

http://hdl.handle.net/10400.22/12862

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM_CISTER_Nelissen_2018.pdf		349.86 KB	Adobe PDF	Download

Send Feedback

Authors

Nelissen, Geoffrey

Biondi, Alessandro

Abstract(s)

Motivated by the increasingly wide adoption of realtime workload with self-suspending behaviors, and the relevance of mechanisms to handle mutually-exclusive shared resources, this paper takes a new look at locking protocols for self-suspending tasks under uniprocessor fixed-priority scheduling. Pitfalls when integrating the widely-adopted Stack Resource Policy (SRP) with self-suspending tasks are firstly illustrated, and then a new finegrained SRP analysis is presented. Next, a new locking protocol, named SRP-SS, is proposed to overcome the limitations of the original SRP. The SRP-SS is a generalization of the SRP to cope with the specificities of self-suspending tasks. It therefore reduces to the SRP under some configurations and hence theoretically dominates the SRP. It also ensures backward compatibility for applications developed specifically for the SRP. The SRP-SS comes with its own schedulability analysis and configuration algorithm. The performances of the SRP and SRP-SS are finally studied by means of large-scale schedulability experiments.