The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2007)
Long Beach, CA, USA
Mar. 26, 2007 to Mar. 30, 2007
ISBN: 1-4244-0909-8
pp: 154
Nathan Fisher , University of North Carolina, Chapel Hill, USA.
Marko Bertogna , Scuola Superiore S.Anna, Pisa, Italy.
Sanjoy Baruah , University of North Carolina, Chapel Hill, USA.
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. In a companion paper [13], we formally defined and studied 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. We extend the discussion and results from [13] to systems scheduled using static-priority scheduling algorithms, with resource access arbitrated using Stack Resource Policy (SRP), or Priority Ceiling Protocol (PCP). We present a method to compute resource hold times for every resource, and an algorithm to decrease them without changing the semantics of the application or compromising application feasibility.
Nathan Fisher, Marko Bertogna, Sanjoy Baruah, "Static-Priority Scheduling and Resource Hold Times", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 154, 2007, doi:10.1109/IPDPS.2007.370344
89 ms
(Ver 3.3 (11022016))