13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07) (2007)
Apr. 3, 2007 to Apr. 6, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTAS.2007.32
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.
S. Baruah, N. Fisher and M. Bertogna, "Resource-Locking Durations in EDF-Scheduled Systems," 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)(RTAS), Bellevue, Washington, 2007, pp. 91-100.