Liangkai Liu, Zheng-hong Dong, Yanzhi Wang, Weisong Shi
{"title":"Prophet: Realizing a Predictable Real-time Perception Pipeline for Autonomous Vehicles","authors":"Liangkai Liu, Zheng-hong Dong, Yanzhi Wang, Weisong Shi","doi":"10.1109/RTSS55097.2022.00034","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00034","url":null,"abstract":"We have witnessed the broad adoption of Deep Neu-ral Networks (DNNs) in autonomous vehicles (AV). As a safety-critical system, deadline-based scheduling is used to guarantee the predictability of the AV system. However, non-negligible time variations exist for most DNN models in an AV system, even when the whole system is just running one model. The fact that multiple DNNs are running on the same platform makes the time variations issue even more severe. However, none of the existing works have thoroughly studied the root cause of the time variation issue. In the first part of the paper, we conducted a comprehensive empirical study. We found that the inference time variations for a single DNN model are mainly caused by the DNN's multi-stage/multi-branch structure, which has a dynamic number of proposals or raw points. In addition, we found that the uncoordinated contention and cooperation are the roots of the time variations for multi-tenant DNNs inference. Second, based on these insights, we proposed the Prophet system that addresses the time variations in the AV perception system in two steps. The first step is to predict the time variations based on the intermediate results like proposals and raw points. The second step is coordinating the multi-tenant DNNs to ensure the execution progress is close to each other. From the evaluation results on the KITTI dataset, the time prediction of a single model all achieve higher than 91% accuracy for Faster R-CNN, LaneNet, and PINet. Besides, the perception fusion delay is bounded to 150ms, and the fusion drop ratio is reduced from 5.4% to less than 1 percent.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115567155","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}
{"title":"A Utilization-based Test for Non-preemptive Gang Tasks on Multiprocessors","authors":"Zheng Dong, Cong Liu","doi":"10.1109/RTSS55097.2022.00019","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00019","url":null,"abstract":"Real-time gang task scheduling has received much recent attention due to the emerging trend of applying highly parallel accelerators (e.g., GPU) and parallel programming models (e.g., OpenMP) in many real-time computing domains. However, existing works on gang task scheduling mainly focus on the preemptive scheduling case, which contradicts a bit with the non-preemptive executing nature of applying gang scheduling techniques in practice. In this paper, we present a set of non-trivial techniques that can analyze the schedulability of scheduling a hard real-time sporadic gang task system under non-preemptive GEDF on multiprocessors. A utilization-based schedulability test (first-of-its-kind) is derived, which is shown to be rather effective via experiments. Rather interestingly, for a special case where each gang task becomes an ordinary sporadic task, our developed test is shown by experiments that it improves schedulability by 75% on average upon a state-of-the-art utilization-based test designed for non-preemptive scheduling of ordinary sporadic tasks on multiprocessors.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"708 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122949","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}
{"title":"Real-Time Scheduling with Predictions","authors":"Tianming Zhao, Wei Li, Albert Y. Zomaya","doi":"10.1109/RTSS55097.2022.00036","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00036","url":null,"abstract":"The recent revival in learning theory gives us improved capabilities for accurate predictions and increased opportunities for performance enhancement. This work extends the research agenda of augmenting algorithms with predictions to one of the central scheduling problems – soft real-time scheduling on single and parallel machines to minimize the mean response time. We design an algorithm, PEDRMLF (Predictions Enhanced Dynamic Randomized MultiLevel Feedback), that incorporates job size predictions, achieving an optimal competitive ratio under perfect predictions and the best-known competitive ratio under any predictions. PEDRMLF is the first algorithm that simultaneously achieves optimal consistency and bounded robustness. Simulations show that the proposed algorithm performs close to the theoretically optimal bound while consistently outperforming state-of-the-art benchmarks.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122392440","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}
Harun Teper, Mario Günzel, Niklas Ueter, G. V. D. Brüggen, Jian-Jia Chen
{"title":"End-To-End Timing Analysis in ROS2","authors":"Harun Teper, Mario Günzel, Niklas Ueter, G. V. D. Brüggen, Jian-Jia Chen","doi":"10.1109/RTSS55097.2022.00015","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00015","url":null,"abstract":"Modern autonomous vehicle platforms feature many interacting components and sensors, which add to the system complexity and affect their performance. A key aspect for such platforms are end-to-end timing guarantees, which are required for safe and predictable behavior in every situation. One widely used tool to develop such autonomous systems is the Robot Operating System 2 (ROS2), which allows creating robot applications composed of several components that communicate with each other to form complex systems. Furthermore, it guarantees real-time constraints and provides reliable timing behavior using a custom scheduler design that manages the execution of all components. These components and their data propagation form multiple cause-effect chains that can be analyzed to determine two key metrics: maximum reaction time (which is the maximum time for the system to react to an external input) and maximum data age (which equals the maximum time between sampling and the output of the system being based on that sample). However, an end-to-end analysis for cause-effect chains in ROS2 systems has not been provided yet. In this paper, we provide a theoretical upper bound for the end-to-end timing of a ROS2 system on a single electronic control unit (ECU). Additionally, we show how to simulate a ROS2 system to get a lower bound for the timing analysis and introduce an online end-to-end timing measurement method for existing ROS2 systems. We evaluate our methods with a basic autonomous navigation system and determine the timing behavior for different components and sensor configurations.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126415055","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}
Dakai Zhu, S. Drager, Matthew Anderson, Hakan Aydin
{"title":"Work-in-Progress: Victim-Aware Scheduling for Robust Operations in Safety-Critical Systems","authors":"Dakai Zhu, S. Drager, Matthew Anderson, Hakan Aydin","doi":"10.1109/RTSS55097.2022.00048","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00048","url":null,"abstract":"With ever-increasing attacks against learning-enabled components (LECs) in safety-critical systems, it has become more challenging to ensure robust operations. By focusing on anterior and posterior attacks on LECs, where malicious tasks need to run before and after a victim task, respectively, to launch attacks, we study in this work the victim-aware fixed-priority scheduling in single processor systems. Specifically, by exploiting the preference-oriented fixed-priority (POFP) scheduler, we devise a Victim-Aware Priority Assignment (VAPA) scheme to assign different priorities for victim tasks that are subject to anterior and posterior attacks, respectively. VAPA aims at reducing both anterior and posterior attacking occasions in the resultant schedule and thus enhancing the robust operations of the victim tasks. Online adaptation is also considered by exploiting idle time slots to further remove such attacking occasions whenever possible. The main ideas of the victim-aware scheduling are illustrated via a concrete example and future work is discussed.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121448623","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}
{"title":"Work-in-Progress: Exploring the Composition of Synchronous Intelligent Intersections","authors":"R. Reddy, Luís Almeida, P. Santos, E. Tovar","doi":"10.1109/RTSS55097.2022.00057","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00057","url":null,"abstract":"Private vehicles are expected to continue representing a large share of the urban traffic requiring intelligent management to provide safe and efficient urban mobility. In this context, it is imperative to mitigate traffic congestion and associated travel delays to improve the quality of life of urban dwellers. This paper explores the global performance of grid networks of independent intersections using different intersection management protocols. We particularly aim to compare the performance achieved when using the intelligent intersection management architecture (IIMA) that relies on the synchronous intersection management protocol (SIMP), against two conventional (Round-robin - RR and trivial traffic light control - TTLC) and two adaptive (Max-pressure control algorithm - MCA and Websters traffic light control - WTLC) intersection management approaches. We consider four-way two-lane intersections with two crossing configurations, namely dedicated and shared left lane, on a 2×2 grid network of intersections. Simulation results with SUMO show that composing intersections with synchronous management considerably improves the network throughput and reduces travel delays.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121781306","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}
{"title":"Work-in-Progress: A Novel Clock Synchronization System for Large-Scale Clusters","authors":"Zhuochen Fan, Xiaodong Li, Yanwei Xu, Yuqing Li, Tong Yang, Steve Uhlig","doi":"10.1109/RTSS55097.2022.00056","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00056","url":null,"abstract":"Clock synchronization is essential in real-time applications of large-scale clusters. State-of-the-art Huygens clock synchronization reduces synchronization errors through offset probing loop correction between data center servers. However, Huygens does not offer a solution for large-scale clusters. In this paper, we propose a novel and scalable CAT-Sync clock synchronization system for large-scale clusters, which includes three key techniques: optimal probe topology Construction, probing channel Assignment, and Time-slice synchronization. In CAT-Sync, the workload of each host is the same and will not increase with the expansion of the cluster size. Our CAT-Sync system achieves a stable clock synchronization accuracy within 2 microseconds on 60 virtual machines, and the average clock offset for the entire synchronization process is improved by about 44.8% compared to Huygens.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124234678","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}
{"title":"Task Allocation for Real-time Earth Observation Service with LEO Satellites","authors":"Mingsong Lv, Xuemei Peng, Wenjing Xie, Nan Guan","doi":"10.1109/RTSS55097.2022.00012","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00012","url":null,"abstract":"Traditional Earth observation (EO) services using satellites mainly observe relatively large-scale objects for applications with no or weak real-time requirements. The rapid development of Low-Earth-orbit (LEO) satellites opens new opportunities to provide EO services for a much wider range of applications by collecting the observation and communication capability of many LEO satellites. The challenge is how to select and coordinate the LEO satellites to accomplish the EO task subject to strong real-time constraints. In this work, we present a holistic solution that precisely models the observation service of a single LEO satellite and allocates the work of a periodic real-time EO task to a group of LEO satellites to meet the real-time requirements. Experiments were conducted to evaluate how the parameters of the LEO satellites and the ground stations impact the satisfiability of real-time requirements. The results provide valuable guidelines for designing LEO satellites and ground stations to provide real-time object observation services.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284795","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}
{"title":"Work-in-Progress: Generalized Demand-Based Schedulability Test for Dual-Criticality Sporadic Task Model","authors":"Jiwoo Lee, A. Cheng, Guangli Dai","doi":"10.1109/RTSS55097.2022.00053","DOIUrl":"https://doi.org/10.1109/RTSS55097.2022.00053","url":null,"abstract":"In this paper, we consider the scheduling of dual-criticality sporadic task systems with arbitrary deadlines using demand bound functions. In dual-criticality systems, tasks are assigned either low-criticality or high-criticality based on assurance needs with associated worst-case execution times. Arbitrary deadlines are those that allow the deadline to be larger than the minimum separation between consecutive task instances. Demand bound functions have been used to successfully schedule dual-criticality task sets for constrained deadlines, i.e., deadlines that are always less than or equal to minimum inter-arrival separation time. We formulate a new demand bound function for a more generalized dual-criticality task system with both constrained and arbitrary deadlines on a preemptive uniprocessor.","PeriodicalId":202402,"journal":{"name":"2022 IEEE Real-Time Systems Symposium (RTSS)","volume":"137 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122189713","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}