2014 IEEE Real-Time Systems Symposium最新文献_第3页

The Frame Packing Problem for CAN-FD CAN-FD的帧封装问题

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.8

Unmesh D. Bordoloi, Soheil Samii

引用次数: 31

A Wormhole NoC Protocol for Mixed Criticality Systems 混合临界系统的虫洞NoC协议

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.13

A. Burns, J. Harbin, L. Indrusiak

引用次数: 70

Gemini: A Non-invasive, Energy-Harvesting True Power Meter 双子座:一个非侵入式，能量收集的真正的能量计

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.36

Bradford Campbell, P. Dutta

{"title":"Gemini: A Non-invasive, Energy-Harvesting True Power Meter","authors":"Bradford Campbell, P. Dutta","doi":"10.1109/RTSS.2014.36","DOIUrl":"https://doi.org/10.1109/RTSS.2014.36","url":null,"abstract":"Power meters are critical for sub metering loads in residential and commercial settings, but high installation cost and complexity hamper their broader adoption. Recent approaches address installation burdens by proposing non-invasive meters that easily clip onto a wire, or stick onto a circuit breaker, to perform contact less metering. Unfortunately, these designs require regular maintenance (e.g. Battery replacement) or reduce measurement accuracy (e.g. Work poorly with non-unity power factors). This paper presents Gemini, a new design point in the power metering space. Gemini addresses the drawbacks of prior approaches by decoupling and distributing the AC voltage and current measurement acquisitions, and recombining them wirelessly using a low-bandwidth approach, to offer non-invasive real, reactive, and apparent power metering. Battery maintenance is eliminated by using an energy-harvesting design that enables the meter to power itself using a current transformer. Accuracy is substantially improved over other non-invasive meters by virtualizing the voltage channel -- effectively allowing the meter to calculate power as if it could directly measure voltage (since true power requires sample-by-sample multiplication of current and voltage measurements acquired with tight timing constraints). Collectively, these improvements result in a new design point that meters resistive loads with 0.6 W average error and a range of reactive and switching loads with 2.2 W average error -- matching commercial, mains-powered solutions.","PeriodicalId":353167,"journal":{"name":"2014 IEEE Real-Time Systems Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126404416","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}

引用次数: 24

Integrating Cache-Related Pre-Emption Delays into Analysis of Fixed Priority Scheduling with Pre-Emption Thresholds 将缓存相关抢占延迟集成到带抢占阈值的固定优先级调度分析中

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.25

R. J. Bril, S. Altmeyer, M. V. D. Heuvel, Robert I. Davis, M. Behnam

引用次数: 30

Deriving Unbounded Proof of Linear Hybrid Automata from Bounded Verification 由有界验证导出线性混合自动机的无界证明

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.22

Dingbao Xie, Lei Bu, Xuandong Li

{"title":"Deriving Unbounded Proof of Linear Hybrid Automata from Bounded Verification","authors":"Dingbao Xie, Lei Bu, Xuandong Li","doi":"10.1109/RTSS.2014.22","DOIUrl":"https://doi.org/10.1109/RTSS.2014.22","url":null,"abstract":"The behavior space of real time hybrid systems is very complex and hence expensive to conduct the classical full state space model checking. Compared to the classical model checking, bounded model checking (BMC) is much cheaper to conduct and has better scalability. This work presents a technique that can derive, in some cases, a proof of unbounded reach ability argument of Linear Hybrid Automata (LHA) from a BMC procedure. During BMC of LHA, typical procedures can discover sets of unsatisfiable constraint cores, a.k.a. UC or IIS, in the constraint set according to the bounded continuous state space of LHA. Currently, such unsatisfiable constraints are only fed back to the constraint set to accelerate the BMC solving. In this paper, we propose that such unsatisfiable constraint core can be exploited to give general unbounded verification result of the system model. As each constraint can be mapped back to certain semantical elements of the system model, the unsatisfiable constraint cores can be mapped back into path segments, which are not feasible, in the graph structure of the LHA model. Clearly, if all the potential paths to reach the target location in the graph structure have to go through such infeasible path segments, the target location is not reachable in general, not only in the given bound. Based on this observation, we propose to encode the infeasible path segments as linear temporal logic (LTL) formulas, and present the graph structure, the discrete part, of the LHA model as a transition system. Then, we can take advantage of the mature off-the-shelf LTL model checking techniques to verify whether there exists a path to reach the target location without touching any detected IIS path segment in the graph structure of the LHA model. We implement this technique into a bounded LHA checker BACH. The experiments show that most of the benchmarks can be verified by the enhanced BACH with a clearly better performance and scalability.","PeriodicalId":353167,"journal":{"name":"2014 IEEE Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128960613","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

Scheduling Mixed-Criticality Implicit-Deadline Sporadic Task Systems upon a Varying-Speed Processor 在变速处理器上调度混合临界隐式截止日期零星任务系统

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.15

Sanjoy Baruah, Zhishan Guo

引用次数: 34

Predictable Communication and Migration in the Quest-V Separation Kernel 在Quest-V分离内核中可预测的通信和迁移

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.17

Ye Li, R. West, Zhuoqun Cheng, Eric S. Missimer

{"title":"Predictable Communication and Migration in the Quest-V Separation Kernel","authors":"Ye Li, R. West, Zhuoqun Cheng, Eric S. Missimer","doi":"10.1109/RTSS.2014.17","DOIUrl":"https://doi.org/10.1109/RTSS.2014.17","url":null,"abstract":"Quest-V is a separation kernel, which partitions a system into a collection of sandboxes. Each sandbox encapsulates one or more processing cores, a region of machine physical memory, and a subset of I/O devices. Quest-V behaves like a distributed system on a chip, using explicit communication channels to exchange data and migrate addresses spaces between sandboxes, which operate like traditional hosts. This design has benefits in safety-critical systems, which require continued availability in the presence of failures. Additionally, online faults can be recovered without rebooting an entire system. However, the programming model for such a system is more complicated. Each sandbox has its own local scheduler, and threads must communicate using message passing with those in remote sandboxes. Similarly, address spaces may need to be migrated between sandboxes, to ensure newly forked processes do not violate the feasibility of existing local task schedules. Migration may also be needed to move a thread closer to its required resources, such as I/O devices that are not directly available in the local sandbox. This paper describes how Quest-V performs real-time communication and migration without violating service guarantees for existing threads.","PeriodicalId":353167,"journal":{"name":"2014 IEEE Real-Time Systems Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129166164","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

On the Complexity of Worst-Case Blocking Analysis of Nested Critical Sections 嵌套临界截面最坏情况阻塞分析的复杂性

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.34

Alexander Wieder, Björn B. Brandenburg

引用次数: 14

A Synchronous IPC Protocol for Predictable Access to Shared Resources in Mixed-Criticality Systems 混合临界系统中可预测访问共享资源的同步IPC协议

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.37

Björn B. Brandenburg

{"title":"A Synchronous IPC Protocol for Predictable Access to Shared Resources in Mixed-Criticality Systems","authors":"Björn B. Brandenburg","doi":"10.1109/RTSS.2014.37","DOIUrl":"https://doi.org/10.1109/RTSS.2014.37","url":null,"abstract":"In mixed-criticality systems, highly critical tasks must be temporally and logically isolated from faults in lower-criticality tasks. Such strict isolation, however, is difficult to ensure even for independent tasks, and has not yet been attained if low- and high-criticality tasks share resources subject to mutual exclusion constraints (e.g., Shared data structures, peripheral I/O devices, or OS services), as it is often the case in practical systems. Taking a pragmatic, systems-oriented point of view, this paper argues that traditional real-time locking approaches are unsuitable in a mixed-criticality context: locking is a cooperative activity and requires trust, which is inherently in conflict with the paramount isolation requirements. Instead, a solution based on resource servers (in the microkernel sense) is proposed, and MC-IPC, a novel synchronous multiprocessor IPC protocol for invoking such servers, is presented. The MC-IPC protocol enables strict temporal and logical isolation among mutually untrusted tasks and thus can be used to share resources among tasks of different criticalities. It is shown to be practically viable with a prototype implementation in LITMUSRT and validated with a case study involving several antagonistic failure modes. Finally, MC-IPC is shown to offer analytical benefits in the context of Vestal's mixed-criticality task model.","PeriodicalId":353167,"journal":{"name":"2014 IEEE Real-Time Systems Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128098019","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}

引用次数: 27

Formal Analysis of Timing Effects on Closed-Loop Properties of Control Software 时序对控制软件闭环特性影响的形式化分析

2014 IEEE Real-Time Systems Symposium Pub Date : 2014-12-01 DOI: 10.1109/RTSS.2014.28

Goran Frehse, A. Hamann, Sophie Quinton, M. Woehrle

{"title":"Formal Analysis of Timing Effects on Closed-Loop Properties of Control Software","authors":"Goran Frehse, A. Hamann, Sophie Quinton, M. Woehrle","doi":"10.1109/RTSS.2014.28","DOIUrl":"https://doi.org/10.1109/RTSS.2014.28","url":null,"abstract":"The theories underlying control engineering and real-time systems engineering use idealized models that mutually abstract from central aspects of the other discipline. Control theory usually assumes jitter-free sampling and negligible (constant) input-output latencies, disregarding complex real-world timing effects. Real-time systems theory uses abstract performance models that neglect the functional behavior and derives worst-case situations with limited expressiveness for control functions, e.g., In physically dominated automotive systems. In this paper, we propose an approach that integrates state-of-the art timing models into functional analysis. We combine physical, control and timing models by representing them as a network of hybrid automata. Closed-loop properties can then be verified on this hybrid automata network by using standard model checkers for hybrid systems. Since the computational complexity is critical for model checking, we discuss abstract models of timing behavior that seem particularly suited for this type of analysis. The approach facilitates systematic co-engineering between both control and real-time disciplines, increasing design efficiency and confidence in the system. The approach is illustrated by analyzing an industrial example, the control software of an electro-mechanical braking system, with the hybrid model checker Space Ex.","PeriodicalId":353167,"journal":{"name":"2014 IEEE Real-Time Systems Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123793961","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}

引用次数: 84