In this abstract, we propose specific open problems towardsextending the EPP approach of Bertogna et al. for handlinggeneral conditional code. Furthermore, our objective is toobtain a solution that retains the efficient running time of thenon-branching version of the problem. We believe that suchextensions are absolutely necessary for the EPP approach tobe widely applicable and useful to a real-time system designer.
The Explicit Preemption Placement Problem for Real-Time Conditional Code / Bertogna, Marko; Nathan, Fisher. - STAMPA. - 0:(2011), pp. 12-14. (Intervento presentato al convegno RTSOPS'11 tenutosi a Porto (Portugal) nel July 5, 2011).
The Explicit Preemption Placement Problem for Real-Time Conditional Code
BERTOGNA, Marko;
2011
Abstract
In this abstract, we propose specific open problems towardsextending the EPP approach of Bertogna et al. for handlinggeneral conditional code. Furthermore, our objective is toobtain a solution that retains the efficient running time of thenon-branching version of the problem. We believe that suchextensions are absolutely necessary for the EPP approach tobe widely applicable and useful to a real-time system designer.
| File | Dimensione | Formato | |
|---|---|---|---|
|
RTSOPS11.pdf
Accesso riservato
Tipologia:
AAM - Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione
86.05 kB
Formato
Adobe PDF
|
86.05 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
