{"title":"Worst case delay analysis of shared resource access in partitioned multi-core systems","authors":"Donghyun Kang, Junchul Choi, S. Ha","doi":"10.1145/3139315.3139322","DOIUrl":null,"url":null,"abstract":"In the worst case response time (WCRT) analysis of multi-core systems with shared resources, non-deterministic arbitration delay due to resource contention should be considered conservatively. In this paper, we propose a novel technique for modeling the shared resource contention to find a more accurate upper bound of arbitration delay than the state-of-the-art technique. After computing the worst-case resource demand from each processing element based on the event stream model, we consider the possible scheduling pattern of tasks to make a tighter estimation. The performance of proposed technique is verified by extensive experiments with MediaBench benchmark applications, synthetic task sets, and a real-life automotive example.","PeriodicalId":208026,"journal":{"name":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3139315.3139322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In the worst case response time (WCRT) analysis of multi-core systems with shared resources, non-deterministic arbitration delay due to resource contention should be considered conservatively. In this paper, we propose a novel technique for modeling the shared resource contention to find a more accurate upper bound of arbitration delay than the state-of-the-art technique. After computing the worst-case resource demand from each processing element based on the event stream model, we consider the possible scheduling pattern of tasks to make a tighter estimation. The performance of proposed technique is verified by extensive experiments with MediaBench benchmark applications, synthetic task sets, and a real-life automotive example.