MC-Fluid: Multi-Core Fluid-Based Mixed-Criticality Scheduling

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 165
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Jaewooko
dc.contributor.authorRamanathan, Saravananko
dc.contributor.authorKieu-My Phanko
dc.contributor.authorEaswaran, Arvindko
dc.contributor.authorShin, Insikko
dc.contributor.authorLee, Insupko
dc.date.accessioned2018-04-24T04:25:21Z-
dc.date.available2018-04-24T04:25:21Z-
dc.date.created2018-04-02-
dc.date.created2018-04-02-
dc.date.issued2018-04-
dc.identifier.citationIEEE TRANSACTIONS ON COMPUTERS, v.67, no.4, pp.469 - 483-
dc.identifier.issn0018-9340-
dc.identifier.urihttp://hdl.handle.net/10203/241198-
dc.description.abstractOwing to growing complexity and scale, safety-critical real-time systems are generally designed using the concept of mixed-criticality, wherein applications with different criticality or importance levels are hosted on the same hardware platform. To guarantee non-interference between these applications, the hardware resources, in particular the processor, are statically partitioned among them. To overcome the inefficiencies in resource utilization of such a static scheme, the concept of mixed-criticality real-time scheduling has emerged as a promising solution. Although there are several studies on such scheduling strategies for uniprocessor platforms, the problem of efficient scheduling for the multiprocessor case has largely remained open. In this work, we design a fluid-model based mixed-criticality scheduling algorithm for multiprocessors, in which multiple tasks are allowed to execute on the same processor simultaneously. We derive an exact schedulability test for this algorithm, and also present an optimal strategy for assigning the fractional execution rates to tasks. Since fluid-model based scheduling is not implementable on real hardware, we also present a transformation algorithm from fluid-schedule to a non-fluid one. We also show through experimental evaluation that the designed algorithms outperform existing scheduling algorithms in terms of their ability to schedule a variety of task systems.-
dc.languageEnglish-
dc.publisherIEEE COMPUTER SOC-
dc.subjectMULTIPROCESSORS-
dc.titleMC-Fluid: Multi-Core Fluid-Based Mixed-Criticality Scheduling-
dc.typeArticle-
dc.identifier.wosid000427420800002-
dc.identifier.scopusid2-s2.0-85030779008-
dc.type.rimsART-
dc.citation.volume67-
dc.citation.issue4-
dc.citation.beginningpage469-
dc.citation.endingpage483-
dc.citation.publicationnameIEEE TRANSACTIONS ON COMPUTERS-
dc.identifier.doi10.1109/TC.2017.2759765-
dc.contributor.localauthorShin, Insik-
dc.contributor.nonIdAuthorLee, Jaewoo-
dc.contributor.nonIdAuthorRamanathan, Saravanan-
dc.contributor.nonIdAuthorKieu-My Phan-
dc.contributor.nonIdAuthorEaswaran, Arvind-
dc.contributor.nonIdAuthorLee, Insup-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorReal time systems-
dc.subject.keywordAuthormixed criticality systems-
dc.subject.keywordAuthormultiprocessor systems-
dc.subject.keywordAuthorscheduling algorithm-
dc.subject.keywordAuthorschedulability analysis-
dc.subject.keywordAuthorprocessor speedup factor-
dc.subject.keywordAuthorfluid scheduling-
dc.subject.keywordPlusMULTIPROCESSORS-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0