在制品:利用进度抽象图分析TSN时间感知成形器

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI:10.1109/rtss52674.2021.00052

Srini Srinivasan, Geoffrey Nelissen, R. J. Bril

{"title":"在制品:利用进度抽象图分析TSN时间感知成形器","authors":"Srini Srinivasan, Geoffrey Nelissen, R. J. Bril","doi":"10.1109/rtss52674.2021.00052","DOIUrl":null,"url":null,"abstract":"In this paper, we propose to use Schedule Abstraction Graphs (SAGs) to determine exact worst-case latency of packets at an egress port of an Ethernet TSN switch with Time-aware Shapers (TASs). We briefly sketch how to apply the existing SAG framework in a TSN context and extend the framework with FIFO-queues and TASs.","PeriodicalId":102789,"journal":{"name":"2021 IEEE Real-Time Systems Symposium (RTSS)","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Work-in-Progress: Analysis of TSN Time-Aware Shapers using Schedule Abstraction Graphs\",\"authors\":\"Srini Srinivasan, Geoffrey Nelissen, R. J. Bril\",\"doi\":\"10.1109/rtss52674.2021.00052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose to use Schedule Abstraction Graphs (SAGs) to determine exact worst-case latency of packets at an egress port of an Ethernet TSN switch with Time-aware Shapers (TASs). We briefly sketch how to apply the existing SAG framework in a TSN context and extend the framework with FIFO-queues and TASs.\",\"PeriodicalId\":102789,\"journal\":{\"name\":\"2021 IEEE Real-Time Systems Symposium (RTSS)\",\"volume\":\"2017 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Real-Time Systems Symposium (RTSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/rtss52674.2021.00052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Real-Time Systems Symposium (RTSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rtss52674.2021.00052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在本文中，我们建议使用调度抽象图(sag)来确定具有时间感知形状器(TASs)的以太网TSN交换机出口端口的数据包的确切最坏情况延迟。我们简要概述了如何在TSN上下文中应用现有的SAG框架，并使用fifo队列和TASs扩展该框架。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Work-in-Progress: Analysis of TSN Time-Aware Shapers using Schedule Abstraction Graphs

In this paper, we propose to use Schedule Abstraction Graphs (SAGs) to determine exact worst-case latency of packets at an egress port of an Ethernet TSN switch with Time-aware Shapers (TASs). We briefly sketch how to apply the existing SAG framework in a TSN context and extend the framework with FIFO-queues and TASs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2021 IEEE Real-Time Systems Symposium (RTSS)

自引率

0.00%

发文量