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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 142
  • Download : 0
Owing 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.
Publisher
IEEE COMPUTER SOC
Issue Date
2018-04
Language
English
Article Type
Article
Keywords

MULTIPROCESSORS

Citation

IEEE TRANSACTIONS ON COMPUTERS, v.67, no.4, pp.469 - 483

ISSN
0018-9340
DOI
10.1109/TC.2017.2759765
URI
http://hdl.handle.net/10203/241198
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