Extensibility-aware Fog Computing Platform configuration for mixed-criticality applications

被引:3
作者
Barzegaran, Mohammadreza [1 ]
Pop, Paul [1 ]
机构
[1] Tech Univ Denmark, DTU Compute, Kongens Lyngby, Denmark
基金
欧盟地平线“2020”;
关键词
Fog Computing; Mixed-criticality systems; Scheduling; Extensibility; Evolvability; Optimization; Time-Sensitive Networking; OPTIMIZATION; PERFORMANCE; DESIGN;
D O I
10.1016/j.sysarc.2022.102776
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider that critical control applications and Fog applications share a Fog Computing Platform (FCP). Critical control applications are implemented as periodic hard real-time tasks and messages and have stringent timing and safety requirements, and require safety certification. Fog applications are implemented as aperiodic tasks and messages and are not critical. Such applications need different approaches to guarantee their timing and dependability requirements. We formulate an optimization problem for the joint configuration of critical control and Fog applications, such that (i) the deadlines and Quality-of-Control (QoC) of control applications are guaranteed at design-time, (ii) the configuration is extensible and supports the addition of future new control applications without requiring costly re-certification, and (iii) the design-time configuration together with the runtime Fog resource management mechanisms, can successfully accommodate multiple dynamic responsive Fog applications. We evaluate our approach on several test cases assuming scenarios for hosting both Fog applications and future critical control applications. The results show that our approach generates extensible schedules which enables Fog nodes to handle Fog applications with a shorter response time and a larger number of future control applications.
引用
收藏
页数:13
相关论文
共 60 条
[1]  
Almeida L., 2003, P IEEE REAL TIME SYS
[2]  
[Anonymous], 2016, Official Website of the 802.1 Time-Sensitive Networking Task Group
[3]  
[Anonymous], 2010, IEC 61508
[4]  
[Anonymous], 2018, 8021Q2018 IEEE, P1, DOI [DOI 10.1109/IEEESTD.2018.8403927, 10.1109/IEEESTD.2018.8403927]
[5]  
[Anonymous], 2020, 8021AS2020 IEEE, P1, DOI [10.1109/IEEESTD.2020.9121845, DOI 10.1109/IEEESTD.2020.9121845]
[6]  
[Anonymous], 2018, 19342018 IEEE
[7]   APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING [J].
AUDSLEY, N ;
BURNS, A ;
RICHARDSON, M ;
TINDELL, K ;
WELLINGS, AJ .
SOFTWARE ENGINEERING JOURNAL, 1993, 8 (05) :284-292
[8]   Decentralized Resource Auctioning for Latency-Sensitive Edge Computing [J].
Avasalcai, Cosmin ;
Tsigkanos, Christos ;
Dustdar, Schahram .
2019 IEEE INTERNATIONAL CONFERENCE ON EDGE COMPUTING (IEEE EDGE), 2019, :72-76
[9]  
Barzegaran M., 2020, 2 WORKSHOP FOG COMPU
[10]   Electric drives as fog nodes in a fog computing-based industrial use case [J].
Barzegaran, Mohammadreza ;
Desai, Nitin ;
Qian, Jia ;
Pop, Paul .
JOURNAL OF ENGINEERING-JOE, 2021, 2021 (12) :745-761