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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
