2017 IEEE Real-Time Systems Symposium (RTSS)最新文献_第3页

On the Soft Real-Time Optimality of Global EDF on Uniform Multiprocessors 统一多处理器上全局EDF的软实时最优性

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00037

Kecheng Yang, James H. Anderson

引用次数: 11

Work-in-Progress: TTI: A Timing ISA for LET Model in Safety-Critical Systems 在研工作:TTI:安全关键系统中LET模型的时序ISA

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00047

Bo Wan, Xi Li, Haizhao Luo, Chao Wang, Xianglan Chen, Xuehai Zhou

引用次数: 3

Offset Assignment to Signals for Improving Frame Packing in CAN-FD 信号偏移分配改进CAN-FD帧封装

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00023

Prachi Joshi, S. Ravi, Soheil Samii, Unmesh D. Bordoloi, S. Shukla, Haibo Zeng

{"title":"Offset Assignment to Signals for Improving Frame Packing in CAN-FD","authors":"Prachi Joshi, S. Ravi, Soheil Samii, Unmesh D. Bordoloi, S. Shukla, Haibo Zeng","doi":"10.1109/RTSS.2017.00023","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00023","url":null,"abstract":"Controller Area Network (CAN) is a widely used protocol that allows communication among Electronic Control Units (ECUs) in automotive electronics. It was extended to CAN-FD (CAN with Flexible Data-rate) to meet the increasing demand for bandwidth utilization caused by the growing number of features in modern automobiles. The signal-to-frame packing problem has been studied in literature for both CAN and CAN-FD. In this work, we propose and formulate, for the first time, the signal offset assignment problem (SOAP) in a frame in order to improve the bus bandwidth utilization. We prove that SOAP is NP-complete. We propose a general approximation framework (GAF) for SOAP which can use any approximation algorithm for the makespan minimization problem (MMP) in multiprocessor systems. We derive the performance guarantee provided by GAF as a function of the performance guarantee of the approximation algorithm for MMP and the number of signal periods in the frame. We demonstrate the efficacy of our approach through experiments using three different algorithms (two approximation algorithms and an integer linear programming formulation) for MMP in GAF. Our results indicate that by using offsets for signals in frame packing schemes, one can achieve about 10.54% improvement in bandwidth utilization (on a single bus) in CAN-FD systems.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134086213","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}

引用次数: 6

Event-Driven Bandwidth Allocation with Formal Guarantees for Camera Networks 摄像机网络中具有形式保证的事件驱动带宽分配

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00030

Gautham Nayak Seetanadi, J. Cámara, L. Almeida, Karl-Erik Årzén, M. Maggio

{"title":"Event-Driven Bandwidth Allocation with Formal Guarantees for Camera Networks","authors":"Gautham Nayak Seetanadi, J. Cámara, L. Almeida, Karl-Erik Årzén, M. Maggio","doi":"10.1109/RTSS.2017.00030","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00030","url":null,"abstract":"Modern computing systems are often formed by multiple components that interact with each other through the use of shared resources (e.g., CPU, network bandwidth, storage). In this paper, we consider a representative scenario of one such system in the context of an Internet of Things application. The system consists of a network of self-adaptive cameras that share a communication channel, transmitting streams of frames to a central node. The cameras can modify a quality parameter to adapt the amount of information encoded and to affect their bandwidth requirements and usage. A critical design choice for such a system is scheduling channel access, i.e., how to determine the amount of channel capacity that should be used by each of the cameras at any point in time. Two main issues have to be considered for the choice of a bandwidth allocation scheme: (i) camera adaptation and network access scheduling may interfere with one another, (ii) bandwidth distribution should be triggered only when necessary, to limit additional overhead. This paper proposes the first formally verified event-triggered adaptation scheme for bandwidth allocation, designed to minimize additional overhead in the network. Desired properties of the system are verified using model checking. The paper also describes experimental results obtained with an implementation of the scheme.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"316 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134324628","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}

引用次数: 9

Work-in-Progress: Best-Case Response Time Analysis for Ethernet AVB 正在进行的工作:以太网AVB的最佳响应时间分析

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00043

Hector J. Rivera-Verduzco, P. Cuijpers, Jingyue Cao

引用次数: 2

Synthesis of Queue and Priority Assignment for Asynchronous Traffic Shaping in Switched Ethernet 交换以太网中异步流量整形的队列与优先级分配综合

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00024

Johannes Specht, Soheil Samii

{"title":"Synthesis of Queue and Priority Assignment for Asynchronous Traffic Shaping in Switched Ethernet","authors":"Johannes Specht, Soheil Samii","doi":"10.1109/RTSS.2017.00024","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00024","url":null,"abstract":"Real-time switched Ethernet communication is of increasing importance in many cyber-physical and embedded systems application areas such as automotive electronics, avionics, and industrial control. The IEEE 802.1 Time-Sensitive Networking (TSN) task group develops standards for real-time Ethernet, for example a time-triggered traffic class (IEEE 802.1Qbv-2015). New application areas, such as active safety and autonomous driving using radar, lidar, and camera sensors, which do not fall into the strictly periodic, time-triggered communication model, require a flexible traffic class that can accommodate various communication models while still providing hard real-time guarantees. In our previous work, we developed such a traffic class, Urgency-Based Scheduler (UBS), and its worst-case latency analysis. UBS is currently under standardization (P802.1Qcr) in the TSN task group. In this paper, we introduce and solve the UBS synthesis problem of assigning hard real-time data flows to queues and priorities to queues, the main parameters that determine communication latencies. The synthesis problem is particularly challenging due to the flexibility offered by UBS to aggregate flows and assign individual priority levels per network hop. We present an SMT approach, a cluster-based heuristic, and an extensive experimental evaluation.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116130447","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}

引用次数: 33

Schedulability Analysis of Non-preemptive Real-Time Scheduling for Multicore Processors with Shared Caches 具有共享缓存的多核处理器非抢占式实时调度的可调度性分析

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00026

Jun Xiao, S. Altmeyer, A. Pimentel

引用次数: 29

Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks 具有绑定任务的OpenMP任务系统的实时调度与分析

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00016

Jinghao Sun, Nan Guan, Yang Wang, Qingqiang He, W. Yi

{"title":"Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks","authors":"Jinghao Sun, Nan Guan, Yang Wang, Qingqiang He, W. Yi","doi":"10.1109/RTSS.2017.00016","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00016","url":null,"abstract":"OpenMP is a promising framework for developing parallel real-time software on multi-cores. Although similar to the DAG task model, OpenMP task systems are significantly more difficult to analyze due to constraints posed by the OpenMP specification. An important feature in OpenMP is tied tasks, which must execute on the same thread during the whole life cycle. Although tied tasks enjoy benefits in simplicity and efficiency, it was considered to be not suitable to real-time systems due to its complex behavior. In this paper, we study the realtime scheduling and analysis of OpenMP task systems with tied tasks. First, we show that under the existing scheduling algorithms in OpenMP, tied tasks indeed may lead to extremely bad timing behaviors where the parallel workload is sequentially executed completely. To solve this problem, we proposed a new scheduling algorithm and developed two response time bounds for it, with different trade-off between simplicity and analysis precision. Experiments with both randomly generated OpenMP task systems and realistic OpenMP programs show that the response time bounds obtained by our approach for tied task systems are very close to that of untied tasks.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129788482","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}

引用次数: 35

Functionally and Temporally Correct Simulation of Cyber-Systems for Automotive Systems 汽车系统网络系统的功能和时间正确仿真

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00014

Kyoung-Soo We, Seunggon Kim, Wonseok Lee, Chang-Gun Lee

引用次数: 5

Model Predictive Real-Time Monitoring of Linear Systems 线性系统的模型预测实时监测

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI: 10.1109/RTSS.2017.00035

Xin Chen, S. Sankaranarayanan

{"title":"Model Predictive Real-Time Monitoring of Linear Systems","authors":"Xin Chen, S. Sankaranarayanan","doi":"10.1109/RTSS.2017.00035","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00035","url":null,"abstract":"The predictive monitoring problem asks whether a deployed system is likely to fail over the next T seconds under some environmental conditions. This problem is of the utmost importance for cyber-physical systems, and has inspired real-time architectures capable of adapting to such failures upon forewarning. In this paper, we present a linear model-predictive scheme for the real-time monitoring of linear systems governed by time-triggered controllers and time-varying disturbances. The scheme uses a combination of offline (advance) and online computations to decide if a given plant model has entered a state from which no matter what control is applied, the disturbance has a strategy to drive the system to an unsafe region. Our approach is independent of the control strategy used: this allows us to deal with plants that are controlled using model-predictive control techniques or even opaque machine-learning based control algorithms that are hard to reason with using existing reachable set estimation algorithms. Our online computation reuses the symbolic reachable sets computed offline. The real-time monitor instantiates the reachable set with a concrete state estimate, and repeatedly performs emptiness checks with respect to a safety property. We classify the various alarms raised by our approach in terms of what they imply about the system as a whole. We implement our real-time monitoring approach over numerous linear system benchmarks and show that the computation can be performed rapidly in practice. Furthermore, we also examine the alarms reported by our approach and show how some of the alarms can be used to improve the controller.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133746254","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}

引用次数: 22