R. Lange, R. S. Oliveira, Eduardo Bonet, F. Vasques
{"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}
引用次数: 1
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.