On Non-Preemptive Mixed-Criticality Scheduling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00211284" target="_blank" >RIV/68407700:21230/13:00211284 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Non-Preemptive Mixed-Criticality Scheduling
Original language description
The problem we address in this paper is motivated by the nowadays increasing trend to study and research a mixed-criticality (MC) scheduling, which follows right from the attempts of embedded systems to provide multiple functionalities upon a single shared platform. Consequently, the systems become mixtures of critical functionalities that need to pass a certification process, and non-critical functionalities, that do not. In this paper we present the problem statement and the formal model for the representation of non preemptive mixed-criticality systems, adapting the model proposed by Baruah, Li, and Stougie. Then an integer linear programming formulation is presented. Further we show the results on the computational complexity of the MC scheduling,which we base on a proof of NP-hardness of a simpler problem. Finally we briefly present two metaheuristic algorithms for solving the proposed problem.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů