Resource holding times: computation and optimization |
| |
Authors: | Marko Bertogna Nathan Fisher Sanjoy Baruah |
| |
Affiliation: | (1) ReTiS Lab CEIIC—Scuola Sant’Anna, via Moruzzi 1, 56124 Pisa, Italy;(2) Department of Computer Science, Wayne State University, 431 State Hall, 5143 Cass Avenue, Detroit, MI 48202, USA;(3) Department of Computer Science, The University of North Carolina, Campus Box 3175, Sitterson Hall, Chapel Hill, NC 27599-3175, USA |
| |
Abstract: | In scheduling hard-real-time systems, the primary objective is to meet all deadlines. We study the scheduling of such systems
with the secondary objective of minimizing the duration of time for which the system locks each shared resource. We abstract
out this objective into the resource hold time (rht)—the largest length of time that may elapse between the instant that a system locks a resource and the instant that it subsequently
releases the resource, and study properties of the rht. We present an algorithm for computing resource hold times for every resource in a task system that is scheduled using Earliest
Deadline First scheduling, with resource access arbitrated using the Stack Resource Policy. We also present and prove the
correctness of algorithms for decreasing these rht’s without changing the semantics of the application or compromising application feasibility.
|
| |
Keywords: | Resource-sharing systems Sporadic tasks Critical sections Earliest Deadline First Stack Resource Policy Resource holding times |
本文献已被 SpringerLink 等数据库收录! |
|