2021 IEEE Real-Time Systems Symposium (RTSS)最新文献

Partitioned Scheduling of Recurrent Real-Time Tasks 循环实时任务的分区调度

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00040

Pontus Ekberg, Sanjoy Baruah

引用次数: 3

Work-in-Progress: Evaluation Framework for Self-Suspending Schedulability Tests 正在进行的工作:自挂起可调度性测试的评估框架

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00058

Mario Gunzel, Harun Teper, Kuan-Hsun Chen, Georg von der Bruggen, Jian-Jia Chen

引用次数: 1

Work-in-Progress: Cloud Computing for Time-Triggered Safety-Critical Systems 正在进行的工作:用于时间触发安全关键系统的云计算

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00054

Gautam Gala, Javier Castillo Rivera, G. Fohler

{"title":"Work-in-Progress: Cloud Computing for Time-Triggered Safety-Critical Systems","authors":"Gautam Gala, Javier Castillo Rivera, G. Fohler","doi":"10.1109/rtss52674.2021.00054","DOIUrl":"https://doi.org/10.1109/rtss52674.2021.00054","url":null,"abstract":"Safety-critical (SC) applications require high availability, possibility of run-time reconfiguration, and significant resource over-provisioning. Furthermore, they suffer from hardware obsolescence due to the use of custom or specialized hardware. Cloud computing could be used to resolve these issues. Moreover, they could improve SC systems suffering from scalability issues, e.g., the every growing SC railway network. However, SC applications require low latencies and guarantees that are currently not possible on clouds. In this paper, we explore the possibility of enhancing the current cloud computing paradigm by adding a resource management layer to support the deterministic execution of SC applications while providing the benefits of cloud computing principles. We provide a cloud-wide global resource manager that monitors, controls, and coordinates node-level Local Resource Managers (LRMs) placed on each private cloud node. In addition, we give guarantees to SC Virtual Machines (VMs) on each node via a novel CPU-and memory bandwidth-aware Time-triggered (TT) offline scheduling algorithm that generates a scheduling table for use by an LRM. For improving the utilization of the cloud resources, the LRMs provide flexibility to schedule Event-Triggered (ET) SC and non-critical VM at run-time without regenerating the offline scheduling table. We implemented our approach in a KVM-based private cloud and performed experiments to determine the relevant overheads.","PeriodicalId":102789,"journal":{"name":"2021 IEEE Real-Time Systems Symposium (RTSS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125391610","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

Sub-Linear Overhead in Static Schedules for Fault-Tolerant Transmission 容错传输静态调度中的亚线性开销

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00044

Zhe Wang, Kunal Agrawal, Jeremy T. Fineman

{"title":"Sub-Linear Overhead in Static Schedules for Fault-Tolerant Transmission","authors":"Zhe Wang, Kunal Agrawal, Jeremy T. Fineman","doi":"10.1109/rtss52674.2021.00044","DOIUrl":"https://doi.org/10.1109/rtss52674.2021.00044","url":null,"abstract":"Shared communication media are widely used in many applications including safety critical applications such as control systems on flights or autonomous vehicles. Noise and transient errors can cause transmission failures. We consider the problem of designing fault tolerant static schedules for transmitting messages in these media. In particular, we assume that the schedule of transmission over all messages must be computed in advance and must guarantee that all messages will be delivered as long as the number of medium errors falls below a provided upper bound, regardless of when the medium errors occur. It is crucial that the messages be delivered in a timely manner, and hence we are interested in minimizing the length of the schedule that achieves the desired level of fault tolerance. In this paper, we provide an efficient algorithm for producing a schedule for n messages with total length n+O(f^2log^2n) that can tolerate f medium errors. We also prove that fault-tolerant schedules with length n+O(flog flog n) exist. Since n steps are required to transmit n messages, the overhead of fault tolerance is characterized by the additive terms of O(f^2log^2n) and O(flog flog n), respectively. Both of these terms are sublinear in n and represent asymptotic improvements to the previously best known schedule, which has overhead fn/2.","PeriodicalId":102789,"journal":{"name":"2021 IEEE Real-Time Systems Symposium (RTSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128689244","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

Monte Carlo Response-Time Analysis 蒙特卡罗响应时间分析

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00039

S. Bozhko, G. V. D. Brüggen, Björn B. Brandenburg

{"title":"Monte Carlo Response-Time Analysis","authors":"S. Bozhko, G. V. D. Brüggen, Björn B. Brandenburg","doi":"10.1109/rtss52674.2021.00039","DOIUrl":"https://doi.org/10.1109/rtss52674.2021.00039","url":null,"abstract":"Determining a soft or firm real-time task's probabilistic worst-case response time is a central goal when quantifying and bounding the probability of deadline misses, but current approaches are either (i) fast, but coarse-grained analytical bounds without precision guarantees, (ii) based on convolution and suffer from high space and time complexity, or (iii) combine convolution with resampling techniques that accrue pessimism in an uncontrolled manner. As a new alternative, this paper provides the first probabilistic response-time analysis method based on Monte Carlo simulation, which provides a controlled trade-off between analysis runtime, the desired degree of accuracy, and the permissible probability of a misestimate. An evaluation shows the proposed Monte Carlo analysis to routinely provide more accurate worst-case deadline failure probability (WCDFP) estimates than prior approaches, especially when considering large task sets (where prior methods struggle). In particular, it is shown to scale to workloads with up to 500 tasks while achieving one to three orders of magnitude better precision than analytical or convolution-based approaches (given an equivalent time budget).","PeriodicalId":102789,"journal":{"name":"2021 IEEE Real-Time Systems Symposium (RTSS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121385298","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}

引用次数: 15

Automatic Energy-Hotspot Detection and Elimination in Real-Time Deeply Embedded Systems 实时深度嵌入式系统的能量热点自动检测与消除

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00020

Mohsen Shekarisaz, L. Thiele, M. Kargahi

{"title":"Automatic Energy-Hotspot Detection and Elimination in Real-Time Deeply Embedded Systems","authors":"Mohsen Shekarisaz, L. Thiele, M. Kargahi","doi":"10.1109/rtss52674.2021.00020","DOIUrl":"https://doi.org/10.1109/rtss52674.2021.00020","url":null,"abstract":"Today's deeply embedded systems, with real-time interactions to the environment, are largely battery-operated, and peripheral modules like LTE, WiFi, and GPS are among the most energy-hungry components of them. These components are often under the direct control of an embedded software. Some pieces of the software program are called energy hotspots if they can be transformed towards better system energy consumption while leaving it logically-and temporally-correct. This paper focuses on three such energy hotspots from the peripheral module perspective. The root causes of the hotspots in the software program are misplaced driver calls: Early acquiring or late releasing of the module causes it to waste energy in the active state, having unnecessary distance between the use operations causes extra tail energy overhead, and unaccounted releasing and re-acquiring of the module causes more energy consumption in comparison to leaving the module unreleased. We provide static analysis methods for the detection and elimination of such energy hotspots automatically with regard to some relations between temporal requirements of the real-time embedded software, the time and energy specifications of the module, and the extreme (worst-case/best-case) execution times of specific pieces of the software program. Our simulation results show about 4.7 to 20 percent of energy reductions after elimination of the energy hotspots of the test programs using our proposed method.","PeriodicalId":102789,"journal":{"name":"2021 IEEE Real-Time Systems Symposium (RTSS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133319393","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

Work-in-Progress: Analysis of TSN Time-Aware Shapers using Schedule Abstraction Graphs 在制品:利用进度抽象图分析TSN时间感知成形器

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00052

Srini Srinivasan, Geoffrey Nelissen, R. J. Bril

引用次数: 3

Work-in-Progress: Worst-Case Response Time of Intersection Management Protocols 正在进行的交叉口管理协议的最坏情况响应时间

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00064

R. Reddy, Luís Almeida, Miguel Gutiérrez Gaitán, Harrison Kurunathan, P. Santos, E. Tovar

引用次数: 1

Hot Topic Day 热门话题日

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00009

引用次数: 0

Heterogeneous Quasi-Partitioned Scheduling 异构准分区调度

2021 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2021-12-01 DOI: 10.1109/rtss52674.2021.00033

Ernesto Massa, George Lima, Björn Andersson, V. Petrucci

引用次数: 2