Multimode Security-Aware Real-Time Scheduling on Multiprocessors

被引:0
|
作者
Ren, Jiankang [1 ]
Liu, Chunxiao [1 ]
Lin, Chi [2 ]
Jiang, Wei [3 ]
Wang, Pengfei [1 ]
Qi, Xiangwei [4 ]
Li, Simeng [1 ]
Li, Shengyu [1 ]
机构
[1] Dalian Univ Technol, Key Lab Social Comp & Cognit Intelligence, Minist Educ, Dalian 116024, Peoples R China
[2] Dalian Univ Technol, Sch Software Technol, Dalian 116024, Peoples R China
[3] Univ Elect Sci & Technol China, Sch Informat & Software Engn, Chengdu 610054, Peoples R China
[4] Xinjiang Normal Univ, Sch Comp Sci & Technol, Urumqi 830054, Xinjiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Multimode scheduling; multiprocessor; real-time systems; schedule-based attacks; security-aware scheduling;
D O I
10.1109/TCAD.2024.3445260
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Embedded real-time systems generally execute in a predictable and deterministic manner to deliver critical functionality within stringent timing constraints. However, the predictable execution behavior leaves the system vulnerable to schedule-based attacks. In this article, we present a multimode security-aware real-time scheduling scheme to counteract schedule-based attacks on multiprocessor real-time systems. To mitigate the vulnerability to the schedule-based attack, we propose a multimode scheduling method to reduce the accumulative attack effective window (AEW) of multiple victim tasks and prevent the untrusted tasks from executing during the AEW by distinctively scheduling mixed-trust tasks according to the system mode. To avoid the protection degradation due to the excessive blocking of untrusted tasks, we introduce a protection window for multiple victims on multiprocessors by analyzing the system protection capability limit under the system schedulability constraint. Furthermore, to maximize the protection capability of the multimode security-aware scheduling strategy on a multiprocessor platform, we also propose a security-aware packing algorithm to balance the workloads of mixed-trust tasks on different processors using a mixed-trust worst-fit decreasing heuristic strategy. The experimental results demonstrate that our proposed approach significantly outperforms the state-of-the-art method. Specifically, the AEW ratio and the AEW untrusted execution time ratio are reduced by 18.8% and 62.8%, respectively, while the defense success rate against ScheduLeak attack is improved by 16.3%.
引用
收藏
页码:3407 / 3418
页数:12
相关论文
共 50 条
  • [41] Security-Aware Obfuscated Priority Assignment for CAN FD Messages in Real-Time Parallel Automotive Applications
    Xie, Guoqi
    Li, Renfa
    Hu, Shiyan
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (12) : 4413 - 4425
  • [42] Security-Aware Modeling and Efficient Mapping for CAN-Based Real-Time Distributed Automotive Systems
    Lin, Chung-Wei
    Zhu, Qi
    Sangiovanni-Vincentelli, Alberto
    IEEE EMBEDDED SYSTEMS LETTERS, 2015, 7 (01) : 11 - 14
  • [43] Security-Aware Scheduling of Multiple Scientific Workflows in Cloud
    Roy, Shubhro
    Gharote, Mangesh
    Ramamurthy, Arun
    Pawar, Anand
    Lodha, Sachin
    CLOUD COMPUTING AND SERVICES SCIENCE, CLOSER 2022, CLOSER 2023, 2024, 1845 : 1 - 24
  • [44] Energy-efficient optimal real-time scheduling on multiprocessors
    Funaoka, Kenji
    Kato, Shinpei
    Yamasaki, Nobuyuki
    ISORC 2008: 11TH IEEE SYMPOSIUM ON OBJECT/COMPONENT/SERVICE-ORIENTED REAL-TIME DISTRIBUTED COMPUTING - PROCEEDINGS, 2008, : 23 - 30
  • [45] Work-conserving optimal real-time scheduling on multiprocessors
    Funaoka, Kenji
    Kato, Shinpei
    Yamasaki, Nobuyuki
    ECRTS 2008: PROCEEDINGS OF THE 20TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 2008, : 13 - 22
  • [46] On-line real-time task scheduling on partitionable multiprocessors
    Mohapatra, P
    Ahn, BJ
    Shi, JF
    EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 350 - 357
  • [47] On-line scheduling of hard real-time tasks on multiprocessors
    Dominic, M
    Jain, BN
    3RD INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1996, : 392 - 399
  • [48] Effectively Scheduling Hard and Soft Real-Time Tasks on Multiprocessors
    Nascimento, Flavia Maristela S.
    Lima, George
    2021 IEEE 27TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2021), 2021, : 210 - 222
  • [49] Workload-aware harmonic partitioned scheduling for fixed-priority probabilistic real-time tasks on multiprocessors
    Ren, Jiankang
    Xie, Yong
    Bi, Ran
    He, Yifan
    Wu, Guowei
    Tan, Guozhen
    JOURNAL OF SYSTEMS ARCHITECTURE, 2019, 93 : 20 - 32
  • [50] Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
    Cho, Hyeonjoong
    Easwaran, Arvind
    IEEE ACCESS, 2020, 8 : 172136 - 172151