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
Resource-Locking Durations in EDF-Scheduled Systems / N., Fisher; Bertogna, Marko; S. K., Baruah. - STAMPA. - 0:(2007), pp. 91-100. (Intervento presentato al convegno 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07 tenutosi a Bellevue, WA, usa nel April 3-6, 2007) [10.1109/RTAS.2007.32].
Resource-Locking Durations in EDF-Scheduled Systems
BERTOGNA, Marko;
2007
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 feasibilityFile | Dimensione | Formato | |
---|---|---|---|
RTAS07.pdf
Accesso riservato
Tipologia:
AAM - Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione
190.46 kB
Formato
Adobe PDF
|
190.46 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris