Proceedings of the 24th International Conference on Real-Time Networks and Systems最新文献

Enabling Compositionality for Multicore Timing Analysis 启用多核时序分析的组合性

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997471

S. Hahn, M. Jacobs, J. Reineke

引用次数: 39

Schedulability analysis of dependent probabilistic real-time tasks 相关概率实时任务的可调度性分析

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997499

Slim Ben-Amor, Dorin Maxim, L. Cucu-Grosjean

引用次数: 14

Traversal time for weakly synchronized CAN bus 弱同步CAN总线的遍历时间

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997477

Hugo Daigmorte, M. Boyer

引用次数: 9

Mapping hard real-time applications on many-core processors 在多核处理器上映射硬实时应用程序

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997496

Quentin Perret, Pascal Maurère, É. Noulard, C. Pagetti, P. Sainrat, B. Triquet

引用次数: 31

Partitioning and Interface Synthesis in Hierarchical Multiprocessor Real-Time Systems 分层多处理机实时系统的划分与接口综合

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997489

Alessandro Biondi, G. Buttazzo, M. Bertogna

引用次数: 3

Independent yet Tight WCRT Analysis for Individual Priority Classes in Ethernet AVB 以太网AVB中单个优先级类的独立而严密的WCRT分析

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997493

Jingyue Cao, P. Cuijpers, R. J. Bril, J. Lukkien

{"title":"Independent yet Tight WCRT Analysis for Individual Priority Classes in Ethernet AVB","authors":"Jingyue Cao, P. Cuijpers, R. J. Bril, J. Lukkien","doi":"10.1145/2997465.2997493","DOIUrl":"https://doi.org/10.1145/2997465.2997493","url":null,"abstract":"In the high-tech and automotive industry, bandwidth considerations and widely accepted standardization are two important reasons why Ethernet is currently being considered as an alternative solution for real-time communication (compared to the traditional fieldbusses). Although Ethernet was originally not intended for this purpose, the development of the Ethernet AVB standard enables its use for transporting high-volume data (e.g. from cameras and entertainment applications) with latency guarantees. The traditional busy-period analysis that ensures these latency guarantees relies on knowledge of all data streams, including interference. However, for complex industrial systems, the assumption that characteristics of all interfering data streams are known, is not realistic. As the amount of components connected to an Ethernet network grows, it becomes less likely that one can know or enforce the traffic patterns generated by all these components. In this paper, we present an independent real-time analysis based on so-called eligible intervals, which does not rely on any assumptions on interfering priority classes other than those enforced in the Ethernet AVB standard. We prove our analysis is tight when no additional information on interference is known. Furthermore, we compare the results of our approach to the two most recent busy-period analyses, point out sources of pessimism in these earlier works, and discuss the advantages of using eligible-intervals over busy-period analysis when studying idling servers.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130458360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility 一种可扩展性最大化的控制器局域网消息ID分配策略

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997484

Florian Pölzlbauer, Robert I. Davis, I. Bate

{"title":"A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility","authors":"Florian Pölzlbauer, Robert I. Davis, I. Bate","doi":"10.1145/2997465.2997484","DOIUrl":"https://doi.org/10.1145/2997465.2997484","url":null,"abstract":"Controller Area Network (CAN) is widely used in automotive applications. Policies for message ID and thus priority assignment have a significant impact on schedulability. In addition, they also determine extensibility; the scope to add messages required by future upgrades without compromising schedulability. In this paper we address message ID assignment, such that the system is extensible. First, we provide an assessment metric that provides an in-depth view of the extensibility of a given ID-assignment, tailored for use in automotive applications. Second, we develop a practical ID-assignment policy which maximizes extensibility. This policy provides an upgrade pathway: it is used to provide the initial ID-assignment, and also used for ID-assignments during subsequent upgrades. The policy optimizes extensibility by maintaining Deadline minus Jitter Monotonic Priority Ordering, which ensures that it does not compromise either schedulability or robustness to errors on the bus. Evaluation using a simple automotive benchmark shows the effectiveness of the policy over multiple upgrades.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A Formal Approach for Flexible Modeling and Analysis of Transaction Timeliness and Isolation 事务时效性和隔离性灵活建模和分析的形式化方法

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997495

Simin Cai, B. Gallina, Dag Nyström, C. Seceleanu

{"title":"A Formal Approach for Flexible Modeling and Analysis of Transaction Timeliness and Isolation","authors":"Simin Cai, B. Gallina, Dag Nyström, C. Seceleanu","doi":"10.1145/2997465.2997495","DOIUrl":"https://doi.org/10.1145/2997465.2997495","url":null,"abstract":"Traditional Concurrency Control (CC) mechanisms ensure absence of undesired interference in transaction-based systems and enforce isolation. However, CC may introduce unpredictable delays that could lead to breached timeliness, which is unwanted for real-time transactions. To avoid deadline misses, some CC algorithms relax isolation in favor of timeliness, whereas others limit possible interleavings by leveraging real-time constraints and preserve isolation. Selecting an appropriate CC algorithm that can guarantee timeliness at an acceptable level of isolation thus becomes an essential concern for system designers. However, trading-off isolation for timeliness is not easy with existing analysis techniques in database and real-time communities. In this paper, we propose to use model checking of a timed automata model of the transaction system, in order to check the traded-off timeliness and isolation. Our solution provides modularization for the basic transactional constituents, which enables flexible modeling and composition of various candidate CC algorithms, and thus reduces the effort of selecting the appropriate CC algorithm.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116671700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks IEEE 802.1Qbv时间敏感网络中的实时通信调度

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997470

Silviu S. Craciunas, Ramon Serna Oliver, Martin Chmelík, W. Steiner

引用次数: 292

Time for Reactive System Modeling: Interactive Timing Analysis with Hotspot Highlighting 响应系统建模的时间:具有热点突出的交互式时序分析

Proceedings of the 24th International Conference on Real-Time Networks and Systems Pub Date : 2016-10-19 DOI: 10.1145/2997465.2997467

Insa Fuhrmann, David Broman, R. V. Hanxleden, Alexander Schulz-Rosengarten

引用次数: 7