Preemptive Real-Time Scheduling Incorporating Security Constraint for Cyber Physical Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baek, Hyeongboo | - |
dc.contributor.author | Lee, Jaewoo | - |
dc.contributor.author | Lee, Yongjae | - |
dc.contributor.author | Yoon, Hyunsoo | - |
dc.date.accessioned | 2023-02-15T08:41:36Z | - |
dc.date.available | 2023-02-15T08:41:36Z | - |
dc.date.issued | 2016-08 | - |
dc.identifier.issn | 0916-8532 | - |
dc.identifier.issn | 1745-1361 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60656 | - |
dc.description.abstract | Since many cyber-physical systems (CPSs) manipulate security-sensitive data, enhancing the quality of security in a CPS is a critical and challenging issue in CPS design. Although there has been a large body of research on securing general purpose PCs, directly applying such techniques to a CPS can compromise the real-time property of CPSs since the timely execution of tasks in a CPS typically relies on real-time scheduling. Recognizing this property, previous works have proposed approaches to add a security constraint to the real-time properties to cope with the information leakage problem that can arise between real-time tasks with different security levels. However, conventional works have mainly focused on non-preemptive scheduling and have suggested a very naive approach for preemptive scheduling, which shows limited analytical capability. In this paper, we present a new preemptive fixed-priority scheduling algorithm incorporating a security constraint, called lowest security-level first (LSF) and its strong schedulability analysis to reduce the potential of information leakage. Our simulation results show that LSF schedulability analysis outperforms state-of-the-art FP analysis when the security constraint has reasonable timing penalties. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.title | Preemptive Real-Time Scheduling Incorporating Security Constraint for Cyber Physical Systems | - |
dc.type | Article | - |
dc.identifier.doi | 10.1587/transinf.2015EDP7493 | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E99-D, no.8, pp 2121 - 2130 | - |
dc.description.isOpenAccess | Y | - |
dc.identifier.wosid | 000381563200019 | - |
dc.identifier.scopusid | 2-s2.0-84983070601 | - |
dc.citation.endPage | 2130 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 2121 | - |
dc.citation.title | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | - |
dc.citation.volume | E99-D | - |
dc.type.docType | Article | - |
dc.publisher.location | 일본 | - |
dc.subject.keywordAuthor | cyber-physical system | - |
dc.subject.keywordAuthor | security | - |
dc.subject.keywordAuthor | real-time scheduling | - |
dc.subject.keywordAuthor | schedulability analysis | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.