Proceedings of the 26th International Conference on Real-Time Networks and Systems最新文献_第2页

Throughput-Buffering Trade-Off Analysis for Scenario-Aware Dataflow Models 场景感知数据流模型的吞吐量-缓冲权衡分析

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273921

Hadi Alizadeh Ara, M. Geilen, A. Behrouzian, T. Basten

{"title":"Throughput-Buffering Trade-Off Analysis for Scenario-Aware Dataflow Models","authors":"Hadi Alizadeh Ara, M. Geilen, A. Behrouzian, T. Basten","doi":"10.1145/3273905.3273921","DOIUrl":"https://doi.org/10.1145/3273905.3273921","url":null,"abstract":"In multi-media applications, buffers represent storage spaces that are used to store the data communicated between different tasks in the application, and throughput refers to the rate at which output data is produced by the application. The capacities of the buffers influence the throughput, by altering the waiting times for tasks that need to read or write data from or to the buffers. The buffers are realized using memory. To minimize the memory usage, we look for algorithms to compute the minimal capacity requirements for buffers to execute an application under a given throughput constraint. Synchronous dataflow (SDF) is a common formalism used to model applications in such algorithms. SDF however, is not suitable to describe today's dynamic applications, as it cannot express task variations. Finite-State-Machine Scenario-Aware Dataflow (FSM-SADF) is an extension of SDF that allows for not only task variations, but also structural variations, making it suitable for a wide range of dynamic applications. This paper provides the first throughput-bufering trade-of analysis for FSM-SADF models. The analysis provides the Pareto space of throughput and storage space trade-offs. The trade-off analysis is done by a guided Design Space Exploration (DSE) that cuts-off the exploration on non-critical buffers. The core of such a DSE is an FSM-SADF throughput analysis that, given the capacity of every buffer, obtains the throughput, as well as the critical buffers. We demonstrate the feasibility of our analysis with a number of examples.","PeriodicalId":236964,"journal":{"name":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916873","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}

引用次数: 2

WCTT analysis of avionics Switched Ethernet Network with WRR Scheduling 带WRR调度的航电交换以太网WCTT分析

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273925

Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul

引用次数: 8

Automated generation of time-predictable executables on multicore 在多核上自动生成时间可预测的可执行文件

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273907

C. Pagetti, J. Forget, H. Falk, Dominic Oehlert, Arno Luppold

引用次数: 20

Response Time Analysis for Fixed Priority Servers 固定优先级服务器的响应时间分析

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273927

A. Hamann, D. Dasari, Jorge Martinez, D. Ziegenbein

引用次数: 4

Dynamic Wireless Network Reconfiguration for Control System applied to a Nuclear Reactor Case Study 动态无线网络重构在核反应堆控制系统中的应用

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273912

Wenchen Wang, D. Mossé, D. Cole, J. Pickel

{"title":"Dynamic Wireless Network Reconfiguration for Control System applied to a Nuclear Reactor Case Study","authors":"Wenchen Wang, D. Mossé, D. Cole, J. Pickel","doi":"10.1145/3273905.3273912","DOIUrl":"https://doi.org/10.1145/3273905.3273912","url":null,"abstract":"Control systems using sensors and wireless networks are becoming more prevalent, due to its ease of deployment (no wires and no electricity) and maintenance (longer lifetime). However, interference and noise can cause delays and packet losses that can degrade control system performance, which leads us to find the optimal network configuration to minimize that impact. Another problem of wireless networks for control systems is caused by time-varying fault patterns, which motivates us to do network reconfiguration at runtime. We focus on the online wireless network reconfiguration in an embedded networked and cyber-physical system (CPS), with four main contributions: (1) the design and implementation of a novel network reconfiguration framework with offline and online components that consider time-correlated link failures; (2) a network imperfection model; (3) six online reconfiguration algorithms for wireless control system; (4) a case study with 12 hops and up to 50 nodes that controls a nonlinear small modular nuclear reactor. Our network imperfection model is accurate (with 0.993 Pearson correlation) and our online reconfiguration algorithms have smaller error and longer network lifetime than a state-of-the-art static scheme.","PeriodicalId":236964,"journal":{"name":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015520","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}

引用次数: 4

On Budgeting and Quality, with an Application to Safety-Critical Real-time Systems 预算与质量，及其在安全关键型实时系统中的应用

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273917

B. Alahmad, S. Gopalakrishnan

{"title":"On Budgeting and Quality, with an Application to Safety-Critical Real-time Systems","authors":"B. Alahmad, S. Gopalakrishnan","doi":"10.1145/3273905.3273917","DOIUrl":"https://doi.org/10.1145/3273905.3273917","url":null,"abstract":"Mandated by modern real-time applications that operate for long durations under (random) bandwidth limitations, we develop a suitable notion of quality of service (QoS) that makes explicit the inherent tradeoffs between the required execution demand and the available budget. We derive bounds on central timing parameters relating the execution demands of tasks to the available budgets which, if satisfied by the tasks, allows us to establish probably approximately correct (PAC) bounds that quantify the long-term evolution of quality of execution. Such large-deviation bounds furnish proof that tasks achieve their desired QoS levels at an exponentially-decaying rate, and, once attained, these levels are sustained and guaranteed for the entire (possibly indefinite) operation horizon, in spite of random fluctuations in budget availability. We study the case when task execution requirements and/or available budgets are dependent, and we derive sufficient conditions under which non-trivial system-wide PAC-type quality guarantees exist under limited dependence. We do so through a novel application of the Lovász Local Lemma. We also present a use-case involving an application of our bounds to safety-critical systems, where the goal is to synthesize runtime monitors and their timing characteristics under a rather general isochronous execution model on multiple processors. We show how to compute monitor worst-case execution times so that tasks attain given QoS levels and also meet their hard deadlines. We treat the related scheduling and feasibility questions, and we show how to derive feasible isochronous Dp-Fair schedules, if they exist, in polynomial-time.","PeriodicalId":236964,"journal":{"name":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128488418","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}

引用次数: 1

WiseTOP

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273919

Lorenzo Bergamini, J. Decotignie, P. Dallemagne

引用次数: 2

Proceedings of the 26th International Conference on Real-Time Networks and Systems 第26届实时网络与系统国际会议论文集

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905

引用次数: 0

Analysing Real-Time Behaviour of Collective Communication Patterns in MPI MPI中集体通信模式的实时行为分析

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273906

Alexander Stegmeier, Martin Frieb, Jörg Mische, T. Ungerer

引用次数: 0

Configurations and Optimizations of TDMA Schedules for Periodic Packet Communication on Networks on Chip 片上网络周期性分组通信TDMA调度的配置与优化

Proceedings of the 26th International Conference on Real-Time Networks and Systems Pub Date : 2018-10-10 DOI: 10.1145/3273905.3273928

Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen

引用次数: 4