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

Improved Energy-Aware Strategies for Periodic Real-Time Tasks under Reliability Constraints 可靠性约束下周期性实时任务的改进能量感知策略

2019 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2019-12-01 DOI: 10.1109/RTSS46320.2019.00013

Li Han, Louis-Claude Canon, J. Liu, Y. Robert, F. Vivien

引用次数: 9

Semi-Clairvoyance in Mixed-Criticality Scheduling 混合临界调度中的半透视

2019 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2019-12-01 DOI: 10.1109/RTSS46320.2019.00047

Kunal Agrawal, Sanjoy Baruah, A. Burns

引用次数: 7

Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems 多核系统全局EDF的条件最优任务并行化

2019 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2019-12-01 DOI: 10.1109/RTSS46320.2019.00027

Youngeun Cho, Do Hyung Kim, Daechul Park, Seung Su Lee, Chang-Gun Lee

引用次数: 1

Cache Persistence Analysis: Finally Exact 缓存持久性分析:最终准确

2019 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2019-09-10 DOI: 10.1109/RTSS46320.2019.00049

Gregory Stock, S. Hahn, J. Reineke

{"title":"Cache Persistence Analysis: Finally Exact","authors":"Gregory Stock, S. Hahn, J. Reineke","doi":"10.1109/RTSS46320.2019.00049","DOIUrl":"https://doi.org/10.1109/RTSS46320.2019.00049","url":null,"abstract":"Cache persistence analysis is an important part of worst-case execution time (WCET) analysis. It has been extensively studied in the past twenty years. Despite these efforts, all existing persistence analyses are approximative in the sense that they are not guaranteed to find all persistent memory blocks. In this paper, we close this gap by introducing the first exact persistence analysis for caches with least-recently-used (LRU) replacement. To this end, we first introduce an exact abstraction that exploits monotonicity properties of LRU to significantly reduce the information the analysis needs to maintain for exact persistence classifications. We show how to efficiently implement this abstraction using zero-suppressed binary decision diagrams (ZDDs) and introduce novel techniques to deal with uncertainty that arises during the analysis of data caches. The experimental evaluation demonstrates that the new exact analysis is competitive with state-of-the-art inexact analyses in terms of both memory consumption and analysis run time, which is somewhat surprising as we show that persistence analysis is NP-complete. We also observe that while prior analyses are not exact in theory they come close to being exact in practice.","PeriodicalId":102892,"journal":{"name":"2019 IEEE Real-Time Systems Symposium (RTSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128898124","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}

引用次数: 12

Synthesizing Real-Time Schedulability Tests using Evolutionary Algorithms: A Proof of Concept 使用进化算法综合实时可调度性测试:概念证明

2019 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2019-09-07 DOI: 10.1109/RTSS46320.2019.00015

P. Dziurzański, Robert I. Davis, L. Indrusiak

引用次数: 3