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

Modeling Parallel Real-time Tasks with Di-Graphs 用di - graph建模并行实时任务

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

H. Zahaf, A. Benyamina, G. Lipari, R. Olejnik, Pierre Boulet

引用次数: 6

Intrusion-Damage Assessment and Mitigation in Cyber-Physical Systems for Control Applications 用于控制应用的网络物理系统中的入侵损害评估和缓解

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

Rouhollah Mahfouzi, A. Aminifar, P. Eles, Zebo Peng, M. Villani

{"title":"Intrusion-Damage Assessment and Mitigation in Cyber-Physical Systems for Control Applications","authors":"Rouhollah Mahfouzi, A. Aminifar, P. Eles, Zebo Peng, M. Villani","doi":"10.1145/2997465.2997478","DOIUrl":"https://doi.org/10.1145/2997465.2997478","url":null,"abstract":"With cyber-physical systems opening to the outside world, security can no longer be considered a secondary issue. One of the key aspects in security of cyber-phyiscal systems is to deal with intrusions. In this paper, we highlight the several unique properties of control applications in cyber-physical systems. Using these unique properties, we propose a systematic intrusion-damage assessment and mitigation mechanism for the class of observable and controllable attacks. On the one hand, in cyber-physical systems, the plants follow certain laws of physics and this can be utilized to address the intrusion-damage assessment problem. That is, the states of the controlled plant should follow those expected according to the physics of the system and any major discrepancy is potentially an indication of intrusion. Here, we use a machine learning algorithm to capture the normal behavior of the system according to its dynamics. On the other hand, the control performance strongly depends on the amount of allocated resources and this can be used to address the intrusion-damage mitigation problem. That is, the intrusion-damage mitigation is based on the idea of allocating more resources to the control application under attack. This is done using a feedback-based approach including a convex optimization.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"29 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":"132743779","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 the Problem of Finding Optimal Harmonic Periods 寻找最优调和周期问题

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

M. Mohaqeqi, M. Nasri, Yang Xu, A. Cervin, Karl-Erik Årzén

{"title":"On the Problem of Finding Optimal Harmonic Periods","authors":"M. Mohaqeqi, M. Nasri, Yang Xu, A. Cervin, Karl-Erik Årzén","doi":"10.1145/2997465.2997490","DOIUrl":"https://doi.org/10.1145/2997465.2997490","url":null,"abstract":"Harmonic periods have wide applicability in industrial realtime systems. Rate monotonic (RM) is able to schedule task sets with harmonic periods up to 100% utilization. Also, if there is no release jitter and execution time variation, RM and EDF generate the same schedule for each instance of a task. This property decreases the jitters which happen during sampling and actuation of the tasks, and hence, it increases the quality of service in control systems. In this paper, we consider the problem of optimal period assignment where the periods are constrained to be harmonic. First, we assume that an interval is determined a priori for each task from which its period can be selected. The goal is to assign a (harmonic) period to each task such that the total system utilization is maximized while the task set remains feasible. We show that this problem is (at least) weakly NP-hard. This is shown by reducing the NP-complete number partitioning problem to the mentioned harmonic period assignment problem. Afterwards, we consider a variant of the problem in which the periods are not restricted to a special interval and the objective is to minimize the total weighted sum of the periods with the same feasibility constraint. We present two approximation algorithms for the second problem and show that the maximum error of these algorithms is bounded by a factor of 2. Our evaluations show that, on the average, results of the approximation algorithms are very close to an optimal solution.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"2 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":"128116333","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}

引用次数: 11

Computing latency of a real-time system modeled by Synchronous Dataflow Graph 用同步数据流图建模实时系统的计算延迟

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

Jad Khatib, Alix Munier Kordon, Enagnon Cédric Klikpo, Kods Trabelsi-Colibet

引用次数: 18

Reducing Response-Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms 异构多核平台上基于dag的任务系统响应时间边界的减小

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

Kecheng Yang, Ming Yang, James H. Anderson

{"title":"Reducing Response-Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms","authors":"Kecheng Yang, Ming Yang, James H. Anderson","doi":"10.1145/2997465.2997486","DOIUrl":"https://doi.org/10.1145/2997465.2997486","url":null,"abstract":"This paper considers for the first time end-to-end response-time analysis for DAG-based real-time task systems implemented on heterogeneous multicore platforms. The specific analysis problem that is considered was motivated by an industrial collaboration involving wireless cellular base stations. The DAG-based systems considered herein allow intra-task parallelism: while each invocation of a task (i.e., DAG node) is sequential, successive invocations of a task may execute in parallel. In the proposed analysis, this characteristic is exploited to reduce response-time bounds. Additionally, there is some leeway in choosing how to set tasks' relative deadlines. It is shown that by resolving such choices holistically via linear programming, response-time bounds can be further reduced. Finally, in the considered use case, DAGs are defined based upon just a few templates and individually often have quite low utilizations. It is shown that, by combining many such DAGs into one of higher utilization, response-time bounds can often be drastically lowered. The effectiveness of these techniques is demonstrated via both case-study and schedulability experiments.","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":"129537510","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}

引用次数: 37

Quantifying the Effect of Period Ratios on Schedulability of Rate Monotonic 量化周期比对速率单调可调性的影响

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

M. Nasri, M. Mohaqeqi, G. Fohler

引用次数: 3

Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling 固定优先级抢占和非抢占调度下的回写缓存分析

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

Robert I. Davis, S. Altmeyer, J. Reineke

引用次数: 7

EDF-hv: An Energy-Efficient Semi-Partitioned Approach for Hard Real-Time Systems EDF-hv:硬实时系统的节能半分区方法

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

Jesse Patterson, Thidapat Chantem

引用次数: 3

Response Time Analysis of Synchronous Data Flow Programs on a Many-Core Processor 多核处理器同步数据流程序的响应时间分析

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

H. Rihani, M. Moy, Claire Maiza, Robert I. Davis, S. Altmeyer

{"title":"Response Time Analysis of Synchronous Data Flow Programs on a Many-Core Processor","authors":"H. Rihani, M. Moy, Claire Maiza, Robert I. Davis, S. Altmeyer","doi":"10.1145/2997465.2997472","DOIUrl":"https://doi.org/10.1145/2997465.2997472","url":null,"abstract":"In this paper we introduce a response time analysis technique for Synchronous Data Flow programs mapped to multiple parallel dependent tasks running on a compute cluster of the Kalray MPPA-256 many-core processor. The analysis we derive computes a set of response times and release dates that respect the constraints in the task dependency graph. We extend the Multicore Response Time Analysis (MRTA) framework by deriving a mathematical model of the multi-level bus arbitration policy used by the MPPA. Further, we refine the analysis to account for the release dates and response times of co-runners, and the use of memory banks. Further improvements to the precision of the analysis were achieved by splitting each task into two sequential phases, with the majority of the memory accesses in the first phase, and a small number of writes in the second phase. Our experimental evaluation focused on an avionics case study. Using measurements from the Kalray MPPA-256 as a basis, we show that the new analysis leads to response times that are a factor of 4.15 smaller for this application, than the default approach of assuming worst-case interference on each memory access.","PeriodicalId":245345,"journal":{"name":"Proceedings of the 24th International Conference on Real-Time Networks and Systems","volume":"41 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":"126535048","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}

引用次数: 56

On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension 具有自挂起的散发性任务的定优先可调度性分析

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

M. Mohaqeqi, Pontus Ekberg, W. Yi

引用次数: 7