启用tsn的终端站的缓冲区管理

Christopher Lehr, P. Denzler, Thomas Frühwirth, W. Kastner
{"title":"启用tsn的终端站的缓冲区管理","authors":"Christopher Lehr, P. Denzler, Thomas Frühwirth, W. Kastner","doi":"10.1109/WFCS57264.2023.10144243","DOIUrl":null,"url":null,"abstract":"The change of industrial automation towards a highly interconnected architecture is still ongoing. Time-sensitive networking (TSN) is an essential element for this transition. This paper focuses on TSN end stations, mainly answering how to implement a software-based worst-case execution time (WCET) analyzable buffer management. The two-level segregated fit (TLSF) algorithm was chosen, implemented, and evaluated based on an asymptotic complexity analysis of dynamic storage allocation algorithms. The implemented and improved TLSF algorithm showed similar timing behavior as calculated when executed on a time-predictable platform. The paper concludes by outlining further research.","PeriodicalId":345607,"journal":{"name":"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Buffer Management for TSN-Enabled End Stations\",\"authors\":\"Christopher Lehr, P. Denzler, Thomas Frühwirth, W. Kastner\",\"doi\":\"10.1109/WFCS57264.2023.10144243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The change of industrial automation towards a highly interconnected architecture is still ongoing. Time-sensitive networking (TSN) is an essential element for this transition. This paper focuses on TSN end stations, mainly answering how to implement a software-based worst-case execution time (WCET) analyzable buffer management. The two-level segregated fit (TLSF) algorithm was chosen, implemented, and evaluated based on an asymptotic complexity analysis of dynamic storage allocation algorithms. The implemented and improved TLSF algorithm showed similar timing behavior as calculated when executed on a time-predictable platform. The paper concludes by outlining further research.\",\"PeriodicalId\":345607,\"journal\":{\"name\":\"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WFCS57264.2023.10144243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS57264.2023.10144243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

工业自动化向高度互联架构的转变仍在进行中。时间敏感网络(TSN)是这种转变的基本要素。本文以TSN端站为研究对象,主要探讨了如何实现基于软件的最坏情况执行时间(WCET)可分析缓冲管理。基于动态存储分配算法的渐近复杂度分析,选择、实现和评估了两级分离拟合(TLSF)算法。实现和改进的TLSF算法在时间可预测平台上执行时显示出类似的计时行为。论文最后概述了进一步的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Buffer Management for TSN-Enabled End Stations
The change of industrial automation towards a highly interconnected architecture is still ongoing. Time-sensitive networking (TSN) is an essential element for this transition. This paper focuses on TSN end stations, mainly answering how to implement a software-based worst-case execution time (WCET) analyzable buffer management. The two-level segregated fit (TLSF) algorithm was chosen, implemented, and evaluated based on an asymptotic complexity analysis of dynamic storage allocation algorithms. The implemented and improved TLSF algorithm showed similar timing behavior as calculated when executed on a time-predictable platform. The paper concludes by outlining further research.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信