SHIELD: Security-Aware Scheduling for Real-Time DAGs on Heterogeneous Systems

被引:0
作者
Senapati, Debabrata [1 ,2 ]
Bhagat, Pooja [3 ]
Karfa, Chandan [3 ]
Sarkar, Arnab [3 ]
机构
[1] Indian Inst Technol IIT Guwahati, Dept Comp Sci & Engn, Gauhati, India
[2] SRM Univ AP, Amaravati, India
[3] Indian Inst Technol IIT Kharagpur, Adv Technol Dev Ctr, Kharagpur, India
关键词
DAG scheduling; Real-Time Cyber-Physical Systems; security; list scheduling; heterogeneous platforms; distributed systems; PARALLEL APPLICATIONS; ALGORITHM; RELIABILITY;
D O I
10.1145/3702236
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many control applications in real-time cyber-physical systems are represented as Directed Acyclic Graphs (DAGs) due to complex interactions among their functional components, and executed on distributed heterogeneous platforms. Data communication between dependent task nodes running on different processing elements are often realized through message transmission over a public network, and are hence susceptible to multiple security threats such as snooping, alteration, and spoofing. Several alternative security protocols having varying security strengths and associated implementation overheads are available in the market, for incorporating confidentiality, integrity, and authentication on the transmitted messages. While message size and correspondingly its associated transmission overheads may be marginally increased due to the assignment of security protocols, significant computation overheads must be incurred for securing the message at the location of its source task node and for unlocking security/message extraction at the destination. Obtained security strengths and associated computation overheads vary depending on the set of protocols chosen for a given message from an available pool of protocols. Given lower bounds on the security demands of an application's messages, selecting the appropriate protocols for each message such that a system's overall security is maximized while satisfying constraints related to the resource, task precedence and deadline, is a challenging and computationally hard problem. In this article, we propose an efficient heuristic strategy called SHIELD for security-aware real-time scheduling of DAG-structured applications to be executed on distributed heterogeneous systems. The efficacy of the proposed scheduler is exhibited through extensive simulation-based experiments using two DAG-structured application benchmarks. Our performance evaluation results demonstrate that SHIELD significantly outperforms two greedy baseline strategies SHIELDb in terms of solution generation times (i.e., runtimes) and SHIELDf in terms of achieved security utility. Additionally, a case study on the Traction Control application in automotive systems has been included to exhibit the applicability of SHIELD in real-world settings.
引用
收藏
页数:29
相关论文
共 39 条
[1]  
[Anonymous], CPLEX."
[2]  
[Anonymous], 2004, Introduction to Computer Security
[3]  
[Anonymous], 1976, Computer and Job-Shop Scheduling Theory
[4]  
[Anonymous], COMPUTERS INTRACTABI, DOI DOI 10.1007/S10479-023-05265-X
[5]   List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (03) :682-694
[6]   What is computer security? [J].
Bishop, Matt .
IEEE Security and Privacy, 2003, 1 (01) :67-69
[7]  
Buttazzo GC, 2011, HARD REAL-TIME COMPUTING SYSTEMS: PREDICTABLE SCHEDULING ALGORITHMS AND APPLICATIONS, THIRD EDITION, P1, DOI 10.1007/978-1-14614-0676-1
[8]  
Daniel Shepard, 2012, Drone Hack: Spoofing Attack Demonstration on a Civilian Unmanned Aerial Vehicle
[9]  
Deepakumara Janaka, 2003, NEWF EL COMP ENG C, P1
[10]  
Falliere N., 2011, White Paper Symantec Corp., Secur Resp., V5, P29