Efficient Task-Network Scheduling with Task Conflict Metric in Time-Sensitive Networking

被引:7
作者
Xu, Lei [1 ,2 ,3 ]
Xu, Qimin [1 ,2 ,3 ]
Chen, Cailian [1 ,2 ,3 ]
Zhang, Yanzhou [1 ,2 ,3 ]
Wang, Shouliang [1 ,2 ,3 ]
Guan, Xinping [1 ,2 ,3 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[2] Minist Educ China, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China
[3] Shanghai Engn Res Ctr Intelligent Control & Manag, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Time-Sensitive Networking; task-conflict metric; task-network scheduling; parallel scheduling; SYSTEMS;
D O I
10.1109/TII.2023.3278883
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of Industrial Internet of Things (IIoT), Time-Sensitive Networking (TSN) with deterministic and real-time features has gained broad interest. However, most existing research focuses on the network scheduling with fixed task placement and computing resource allocation, restricting the scheduling space of coupled task-network. To tackle this coupling problem, an efficient task-network scheduling (ETNS) scheme is proposed in this paper for time-sensitive networking. A task-conflict metric (TCM) is established to quantify the competition degree of scheduling resources. For increasing the overall scheduling space, a TCM-aware pre-scheduling method is proposed by optimizing task placement and routing paths to reduce the potential conflicts between tasks. Integrated with the pre-scheduling method, we design a TCM-aware parallel group-scheduling algorithm by reducing the conflicts between task groups to enhance schedulability and scalability. Experiments show that our ETNS scheme significantly improves the schedulability and scalability performances compared with the existing scheduling approaches. The larger number of tasks, the higher the performance improvement.
引用
收藏
页码:1528 / 1538
页数:11
相关论文
共 30 条
[1]  
[Anonymous], 2017, IEEE Std 802.1Qci-2017, P1
[2]  
[Anonymous], 2016, IEEE Std 802.1Qbv-2015
[3]   Routing and Scheduling of Time-Triggered Traffic in Time-Sensitive Networks [J].
Atallah, Ayman A. ;
Hamad, Ghaith Bany ;
Mohamed, Otmane Ait .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (07) :4525-4534
[4]   Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks [J].
Craciunas, Silviu S. ;
Oliver, Ramon Serna ;
Chmelik, Martin ;
Steiner, Wilfried .
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS PROCEEDINGS (RTNS 2016), 2016, :183-192
[5]   Deep Generative Models in the Industrial Internet of Things: A Survey [J].
De, Suparna ;
Bermudez-Edo, Maria ;
Xu, Honghui ;
Cai, Zhipeng .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2022, 18 (09) :5728-5737
[6]   Segmentation of Laser Point Clouds in Urban Areas by a Modified Normalized Cut Method [J].
Dutta, Avishek ;
Engels, Johannes ;
Hahn, Michael .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (12) :3034-3047
[7]   Dynamic Digital Twin and Online Scheduling for Contact Window Resources in Satellite Network [J].
Fan, Huilong ;
Long, Jun ;
Liu, Limin ;
Yang, Zhan .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2023, 19 (05) :7217-7227
[8]   A novel multi-satellite and multi-task scheduling method based on task network graph aggregation [J].
Fan, Huilong ;
Yang, Zhan ;
Zhang, Xi ;
Wu, Shimin ;
Long, Jun ;
Liu, Limin .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 205
[9]  
Lei Xu, 2020, 2020 IEEE Conference on Industrial Cyberphysical Systems (ICPS), P111, DOI 10.1109/ICPS48405.2020.9274702
[10]   Finding Top-k Shortest Paths with Diversity [J].
Liu, Huiping ;
Jin, Cheqing ;
Yang, Bin ;
Zhou, Aoying .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (03) :488-502