检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Xi Jin Changqing Xia Nan Guan Peng Zeng
机构地区:[1]Key Laboratory of Networked Control Systems,Chinese Academy of Sciences,Shenyang 110016 [2]Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang 110016,China [3]Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang 110169,China [4]Department of Computing,Hong Kong Polytechnic University,Hong Kong,China
出 处:《IEEE/CAA Journal of Automatica Sinica》2021年第2期478-490,共13页自动化学报(英文版)
基 金:partially supported by National Key Research and Development Program of China(2018YFB1700200);National Natural Science Foundation of China(61972389,61903356,61803368,U1908212);Youth Innovation Promotion Association of the Chinese Academy of Sciences,National Science and Technology Major Project(2017ZX02101007-004);Liaoning Provincial Natural Science Foundation of China(2020-MS-034,2019-YQ-09);China Postdoctoral Science Foundation(2019M661156)。
摘 要:Time-sensitive networks(TSNs)support not only traditional best-effort communications but also deterministic communications,which send each packet at a deterministic time so that the data transmissions of networked control systems can be precisely scheduled to guarantee hard real-time constraints.No-wait scheduling is suitable for such TSNs and generates the schedules of deterministic communications with the minimal network resources so that all of the remaining resources can be used to improve the throughput of best-effort communications.However,due to inappropriate message fragmentation,the realtime performance of no-wait scheduling algorithms is reduced.Therefore,in this paper,joint algorithms of message fragmentation and no-wait scheduling are proposed.First,a specification for the joint problem based on optimization modulo theories is proposed so that off-the-shelf solvers can be used to find optimal solutions.Second,to improve the scalability of our algorithm,the worst-case delay of messages is analyzed,and then,based on the analysis,a heuristic algorithm is proposed to construct low-delay schedules.Finally,we conduct extensive test cases to evaluate our proposed algorithms.The evaluation results indicate that,compared to existing algorithms,the proposed joint algorithm improves schedulability by up to 50%.
关 键 词:Message fragmentation networked control system real-time scheduling time sensitive network
分 类 号:TN915.0[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3