FlexRay动态段中零星消息的可调度性分析

R. Lange, R. S. Oliveira, Eduardo Bonet, F. Vasques
{"title":"FlexRay动态段中零星消息的可调度性分析","authors":"R. Lange, R. S. Oliveira, Eduardo Bonet, F. Vasques","doi":"10.1109/SBESC.2012.35","DOIUrl":null,"url":null,"abstract":"FlexRay is a communication protocol heavily promoted as the future de facto standard for automotive systems. A major challenge associated with the design of FlexRay systems is the response time analysis of sporadic messages transmitted in the dynamic segment, a problem that has been shown to be a combinatorial problem. Although there are several methods available to make this analysis, they mainly rely on optimization techniques such as Integer Linear Programming (ILP), or use the Real-Time Calculus (RTC) framework. In this work we propose a method with pseudo-polynomial complexity to derive an upper bound for sporadic messages transmitted in the dynamic segment. We assess the performance of the proposed method comparing it with state-of-the-art methods available in the literature.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Schedulability Analysis of Sporadic Messages in the FlexRay Dynamic Segment\",\"authors\":\"R. Lange, R. S. Oliveira, Eduardo Bonet, F. Vasques\",\"doi\":\"10.1109/SBESC.2012.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FlexRay is a communication protocol heavily promoted as the future de facto standard for automotive systems. A major challenge associated with the design of FlexRay systems is the response time analysis of sporadic messages transmitted in the dynamic segment, a problem that has been shown to be a combinatorial problem. Although there are several methods available to make this analysis, they mainly rely on optimization techniques such as Integer Linear Programming (ILP), or use the Real-Time Calculus (RTC) framework. In this work we propose a method with pseudo-polynomial complexity to derive an upper bound for sporadic messages transmitted in the dynamic segment. We assess the performance of the proposed method comparing it with state-of-the-art methods available in the literature.\",\"PeriodicalId\":112286,\"journal\":{\"name\":\"2012 Brazilian Symposium on Computing System Engineering\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Brazilian Symposium on Computing System Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBESC.2012.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Brazilian Symposium on Computing System Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBESC.2012.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

FlexRay是一种通信协议,被大力推广为汽车系统的未来事实上的标准。FlexRay系统设计的一个主要挑战是对动态段中传输的零星信息的响应时间分析,这是一个组合问题。虽然有几种方法可以进行这种分析,但它们主要依赖于优化技术,如整数线性规划(ILP),或使用实时微积分(RTC)框架。在这项工作中,我们提出了一个伪多项式复杂度的方法来推导在动态段中传输的零星消息的上界。我们评估了所提出的方法的性能,将其与文献中可用的最先进的方法进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schedulability Analysis of Sporadic Messages in the FlexRay Dynamic Segment
FlexRay is a communication protocol heavily promoted as the future de facto standard for automotive systems. A major challenge associated with the design of FlexRay systems is the response time analysis of sporadic messages transmitted in the dynamic segment, a problem that has been shown to be a combinatorial problem. Although there are several methods available to make this analysis, they mainly rely on optimization techniques such as Integer Linear Programming (ILP), or use the Real-Time Calculus (RTC) framework. In this work we propose a method with pseudo-polynomial complexity to derive an upper bound for sporadic messages transmitted in the dynamic segment. We assess the performance of the proposed method comparing it with state-of-the-art methods available in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信