MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling
Owing to growing complexity and scale, safetycritical 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 applicatio...
Saved in:
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/85847 http://hdl.handle.net/10220/44062 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-85847 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-858472020-03-07T11:48:57Z MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling Lee, Jaewoo Ramanathan, Saravanan Phan, Kieu-My Easwaran, Arvind Shin, Insik Lee, Insup School of Computer Science and Engineering Real-time and Embedded Systems Scheduling Owing to growing complexity and scale, safetycritical 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 mixedcriticality 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. MOE (Min. of Education, S’pore) Accepted version 2017-11-16T09:32:20Z 2019-12-06T16:11:15Z 2017-11-16T09:32:20Z 2019-12-06T16:11:15Z 2017 2017 Journal Article Lee, J., Ramanathan, S., Phan, K.-M., Easwaran, A., Shin, I., & Lee, I. (2017). MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling. IEEE Transactions on Computers, in press. 0018-9340 https://hdl.handle.net/10356/85847 http://hdl.handle.net/10220/44062 10.1109/TC.2017.2759765 202493 en IEEE Transactions on Computers © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TC.2017.2759765]. 14 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Real-time and Embedded Systems Scheduling |
spellingShingle |
Real-time and Embedded Systems Scheduling Lee, Jaewoo Ramanathan, Saravanan Phan, Kieu-My Easwaran, Arvind Shin, Insik Lee, Insup MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
description |
Owing to growing complexity and scale, safetycritical 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 mixedcriticality 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. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Lee, Jaewoo Ramanathan, Saravanan Phan, Kieu-My Easwaran, Arvind Shin, Insik Lee, Insup |
format |
Article |
author |
Lee, Jaewoo Ramanathan, Saravanan Phan, Kieu-My Easwaran, Arvind Shin, Insik Lee, Insup |
author_sort |
Lee, Jaewoo |
title |
MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
title_short |
MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
title_full |
MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
title_fullStr |
MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
title_full_unstemmed |
MC-Fluid: Multi-core Fluid-based Mixed-Criticality Scheduling |
title_sort |
mc-fluid: multi-core fluid-based mixed-criticality scheduling |
publishDate |
2017 |
url |
https://hdl.handle.net/10356/85847 http://hdl.handle.net/10220/44062 |
_version_ |
1681048984714477568 |