Resource-Locking Durations in EDF-Scheduled Systems

Authors:
Nathan Fisher;Marko Bertogna;Sanjoy Baruah
Affiliations:
-;-;-
Venue:
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Year:
2007

Citing 0
Cited 4

SIRAP: a synchronization protocol for hierarchical resource sharingin real-time open systems

EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Resource holding times: computation and optimization

Real-Time Systems
Sharing resources among independently-developed systems on multi-cores

ACM SIGBED Review
Resource sharing among real-time components under multiprocessor clustered scheduling

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared "open" platform. The concept of resource hold time (RHT) -- the largest length of time that may elapse between the instant that an application system locks a resource and the instant that it subsequently releases the resource--is formally defined and studied in this paper. An algorithm is presented for computing resource hold times for every resource in an application that is scheduled using Earliest Deadline First scheduling, with resource access arbitrated using the Stack Resource Policy. An algorithm is presented for decreasing these RHT's without changing the semantics of the application or compromising application feasibility.