从操作系统窃取任务调度:为时间紧迫的流量启用任务-网络协同调度

Xuyan Jiang, Wenwen Fu, Xiangrui Yang, Yinhan Sun, Zhigang Sun
{"title":"从操作系统窃取任务调度:为时间紧迫的流量启用任务-网络协同调度","authors":"Xuyan Jiang, Wenwen Fu, Xiangrui Yang, Yinhan Sun, Zhigang Sun","doi":"10.1145/3472716.3472868","DOIUrl":null,"url":null,"abstract":"Real-Time Ethernet (RT Ethernet) such as Time-Sensitive Networking and Time-Triggered Ethernet is widely deployed in the distributed real-time systems such as aerospace, automotive and industrial domains\\cite{craciunas2016combined}. Typically, there are many sensoring-computing-actuating Control Loops (CL) requiring real-time and deterministic end-to-end communication. From the network perspective, these CLs work as follow. The sensor generates sensoring traffic periodically to the computing node (i.e. the end system) via RT Ethernet. Then the computing node executes the corresponding task and generates actuating traffic to the actuator. Finally, the actuator receives the traffic and executes the actions accordingly. Sensoring and actuating traffic are both Time-critical (TC) traffic. In order to achieve end-to-end determinism in the loop, the deterministic and real-time process on the end system must be guaranteed. In another word, the task running on the Operating System (OS) of the end system must be scheduled with tight dependency towards the underlying network scheduling decision. Traditionally, the task scheduling strategy on the OS is asynchronous with the underlying network (i.e. frame scheduling). This may incur great uncertainty in the scenario where end-to-end determinism must be achieved. The main reason behind is that the local time of the OS is out of sync with the network whose time is synchronized by sophisticated time synchronization protocols like PTP \\cite{2006NTP}. In order to address this issue, a natural solution would be synchronizing the OS time with the whole network (e.g., integrating PTP into kernel). Moreover, a special scheduling mechanism should also be implemented which takes the packet arrival info into account. However, this requires massive modifications to the kernel and may incur compatibility issues when integrating with different types of the underlying network \\cite{yan2020tsn}. What's more, Commercial-off-the-shelf (COTS) end systems are more adopted in modern real-time system to reduce the cost and shorten the development period \\cite{pellizzoni2008coscheduling}. So it is hard to introduce fundamental changes to the key components of COTS systems. In this poster, we aim to tackle this problem from a different perspective. Specifically, we suggest that by carefully scheduling packets from the ingress engine of the NIC, a task-network co-scheduling can be achieved, which eliminates the necessity of the modification to the task scheduling mechanism on the OS completely. For this purpose, we introduce Frame-Task Co-Scheduling (FTCS), a mechanism that enables co-scheduling of task and network on COTS end systems. FTCS steals task scheduling from OS through time-triggered frame schedule and submission. The potential benefits are as follows. Firstly, FTCS achieves tight co-scheduling of critical task and traffic without any modification of software and hardware on COTS devices. Secondly, OS time on the end system does not need to synchronize with the network. Because the entity executing FTCS will synchronize with network global time. Thus, even if the frequency and phase shift are unmatched , co-scheduling can still be achieved.","PeriodicalId":178725,"journal":{"name":"Proceedings of the SIGCOMM '21 Poster and Demo Sessions","volume":"180 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Steal task scheduling from OS: enabling task-network co-schedule for time-critical traffic\",\"authors\":\"Xuyan Jiang, Wenwen Fu, Xiangrui Yang, Yinhan Sun, Zhigang Sun\",\"doi\":\"10.1145/3472716.3472868\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-Time Ethernet (RT Ethernet) such as Time-Sensitive Networking and Time-Triggered Ethernet is widely deployed in the distributed real-time systems such as aerospace, automotive and industrial domains\\\\cite{craciunas2016combined}. Typically, there are many sensoring-computing-actuating Control Loops (CL) requiring real-time and deterministic end-to-end communication. From the network perspective, these CLs work as follow. The sensor generates sensoring traffic periodically to the computing node (i.e. the end system) via RT Ethernet. Then the computing node executes the corresponding task and generates actuating traffic to the actuator. Finally, the actuator receives the traffic and executes the actions accordingly. Sensoring and actuating traffic are both Time-critical (TC) traffic. In order to achieve end-to-end determinism in the loop, the deterministic and real-time process on the end system must be guaranteed. In another word, the task running on the Operating System (OS) of the end system must be scheduled with tight dependency towards the underlying network scheduling decision. Traditionally, the task scheduling strategy on the OS is asynchronous with the underlying network (i.e. frame scheduling). This may incur great uncertainty in the scenario where end-to-end determinism must be achieved. The main reason behind is that the local time of the OS is out of sync with the network whose time is synchronized by sophisticated time synchronization protocols like PTP \\\\cite{2006NTP}. In order to address this issue, a natural solution would be synchronizing the OS time with the whole network (e.g., integrating PTP into kernel). Moreover, a special scheduling mechanism should also be implemented which takes the packet arrival info into account. However, this requires massive modifications to the kernel and may incur compatibility issues when integrating with different types of the underlying network \\\\cite{yan2020tsn}. What's more, Commercial-off-the-shelf (COTS) end systems are more adopted in modern real-time system to reduce the cost and shorten the development period \\\\cite{pellizzoni2008coscheduling}. So it is hard to introduce fundamental changes to the key components of COTS systems. In this poster, we aim to tackle this problem from a different perspective. Specifically, we suggest that by carefully scheduling packets from the ingress engine of the NIC, a task-network co-scheduling can be achieved, which eliminates the necessity of the modification to the task scheduling mechanism on the OS completely. For this purpose, we introduce Frame-Task Co-Scheduling (FTCS), a mechanism that enables co-scheduling of task and network on COTS end systems. FTCS steals task scheduling from OS through time-triggered frame schedule and submission. The potential benefits are as follows. Firstly, FTCS achieves tight co-scheduling of critical task and traffic without any modification of software and hardware on COTS devices. Secondly, OS time on the end system does not need to synchronize with the network. Because the entity executing FTCS will synchronize with network global time. Thus, even if the frequency and phase shift are unmatched , co-scheduling can still be achieved.\",\"PeriodicalId\":178725,\"journal\":{\"name\":\"Proceedings of the SIGCOMM '21 Poster and Demo Sessions\",\"volume\":\"180 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the SIGCOMM '21 Poster and Demo Sessions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3472716.3472868\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the SIGCOMM '21 Poster and Demo Sessions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3472716.3472868","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

实时以太网(RT Ethernet),如时间敏感网络和时间触发以太网,广泛部署在分布式实时系统中,如航空航天,汽车和工业领域\cite{craciunas2016combined}。通常,有许多传感-计算-驱动控制回路(CL)需要实时和确定性的端到端通信。从网络的角度来看,这些cl的工作方式如下。传感器通过RT以太网周期性地向计算节点(即终端系统)产生传感流量。计算节点执行相应的任务并产生致动流量给致动器。最后,执行器接收到流量并执行相应的动作。感知流量和驱动流量都是时间关键型(TC)流量。为了实现闭环的端到端确定性,必须保证端系统过程的确定性和实时性。换句话说,在终端系统的操作系统(OS)上运行的任务必须严格依赖于底层网络调度决策进行调度。传统上,操作系统上的任务调度策略是与底层网络异步的(即帧调度)。在必须实现端到端确定性的场景中,这可能会导致很大的不确定性。其主要原因是操作系统的本地时间与通过PTP \cite{2006NTP}等复杂的时间同步协议同步的网络时间不同步。为了解决这个问题,一个自然的解决方案是将操作系统时间与整个网络同步(例如,将PTP集成到内核中)。此外,还应该实现一种特殊的调度机制,将数据包到达信息考虑在内。但是,这需要对内核进行大量修改,并且在与不同类型的底层网络\cite{yan2020tsn}集成时可能会产生兼容性问题。此外,现代实时系统更多地采用商用现货(COTS)端系统,以降低成本,缩短开发周期\cite{pellizzoni2008coscheduling}。因此,很难对COTS系统的关键组件进行根本性的改变。在这张海报中,我们的目标是从不同的角度来解决这个问题。具体来说,我们建议通过仔细调度来自网卡入口引擎的数据包,可以实现任务-网络协同调度,从而完全消除了修改操作系统上的任务调度机制的必要性。为此,我们引入了帧-任务协同调度(FTCS),这是一种在COTS端系统上实现任务和网络协同调度的机制。FTCS通过时间触发帧调度和提交从操作系统窃取任务调度。潜在的好处如下。首先,FTCS在不修改COTS设备软硬件的情况下,实现了关键任务和流量的紧密协同调度。其次,终端系统的操作系统时间不需要与网络同步。因为执行FTCS的实体将与网络全局时间同步。因此,即使频率和相移不匹配,仍然可以实现协同调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Steal task scheduling from OS: enabling task-network co-schedule for time-critical traffic
Real-Time Ethernet (RT Ethernet) such as Time-Sensitive Networking and Time-Triggered Ethernet is widely deployed in the distributed real-time systems such as aerospace, automotive and industrial domains\cite{craciunas2016combined}. Typically, there are many sensoring-computing-actuating Control Loops (CL) requiring real-time and deterministic end-to-end communication. From the network perspective, these CLs work as follow. The sensor generates sensoring traffic periodically to the computing node (i.e. the end system) via RT Ethernet. Then the computing node executes the corresponding task and generates actuating traffic to the actuator. Finally, the actuator receives the traffic and executes the actions accordingly. Sensoring and actuating traffic are both Time-critical (TC) traffic. In order to achieve end-to-end determinism in the loop, the deterministic and real-time process on the end system must be guaranteed. In another word, the task running on the Operating System (OS) of the end system must be scheduled with tight dependency towards the underlying network scheduling decision. Traditionally, the task scheduling strategy on the OS is asynchronous with the underlying network (i.e. frame scheduling). This may incur great uncertainty in the scenario where end-to-end determinism must be achieved. The main reason behind is that the local time of the OS is out of sync with the network whose time is synchronized by sophisticated time synchronization protocols like PTP \cite{2006NTP}. In order to address this issue, a natural solution would be synchronizing the OS time with the whole network (e.g., integrating PTP into kernel). Moreover, a special scheduling mechanism should also be implemented which takes the packet arrival info into account. However, this requires massive modifications to the kernel and may incur compatibility issues when integrating with different types of the underlying network \cite{yan2020tsn}. What's more, Commercial-off-the-shelf (COTS) end systems are more adopted in modern real-time system to reduce the cost and shorten the development period \cite{pellizzoni2008coscheduling}. So it is hard to introduce fundamental changes to the key components of COTS systems. In this poster, we aim to tackle this problem from a different perspective. Specifically, we suggest that by carefully scheduling packets from the ingress engine of the NIC, a task-network co-scheduling can be achieved, which eliminates the necessity of the modification to the task scheduling mechanism on the OS completely. For this purpose, we introduce Frame-Task Co-Scheduling (FTCS), a mechanism that enables co-scheduling of task and network on COTS end systems. FTCS steals task scheduling from OS through time-triggered frame schedule and submission. The potential benefits are as follows. Firstly, FTCS achieves tight co-scheduling of critical task and traffic without any modification of software and hardware on COTS devices. Secondly, OS time on the end system does not need to synchronize with the network. Because the entity executing FTCS will synchronize with network global time. Thus, even if the frequency and phase shift are unmatched , co-scheduling can still be achieved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信