About: On Non-Preemptive Mixed-Criticality Scheduling     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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.
  • 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. (en)
Title
  • On Non-Preemptive Mixed-Criticality Scheduling
  • On Non-Preemptive Mixed-Criticality Scheduling (en)
skos:prefLabel
  • On Non-Preemptive Mixed-Criticality Scheduling
  • On Non-Preemptive Mixed-Criticality Scheduling (en)
skos:notation
  • RIV/68407700:21230/13:00211284!RIV14-GA0-21230___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP103/12/1994)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93761
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/13:00211284
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • scheduling; time complexity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [B7847175E9DD]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hanzálek, Zdeněk
  • Tunys, T.
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software