发布求助
文献互助 智能选刊 最新文献

2010 31st IEEE Real-Time Systems Symposium最新文献

筛选
英文 中文
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers 全局、分区和集群多处理器EDF调度器的经验比较
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.23
Andrea Bastoni, Björn B. Brandenburg, James H. Anderson
{"title":"An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers","authors":"Andrea Bastoni, Björn B. Brandenburg, James H. Anderson","doi":"10.1109/RTSS.2010.23","DOIUrl":"https://doi.org/10.1109/RTSS.2010.23","url":null,"abstract":"As multicore platforms become ever larger, overhead-related factors play a greater role in determining which real-time scheduling algorithms are preferable. In this paper, such factors are investigated through an empirical comparison of global, partitioned, and clustered EDF scheduling algorithms on a 24-core Intel system. On this platform, global EDF proved to be a non-viable choice for hard real time systems, while clusters of size six practically approximated global approaches. For soft real-time systems, clustered EDF scheduling algorithms proved to be particularly effective. This study suggests that future global scheduling research should focus on small-to-medium multicore platforms rather than large platforms.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122748778","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}
引用次数: 169
Reasoning About the Reliability of Multi-version, Diverse Real-Time Systems 多版本、多样化实时系统可靠性分析
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.43
A. Burns, B. Littlewood
{"title":"Reasoning About the Reliability of Multi-version, Diverse Real-Time Systems","authors":"A. Burns, B. Littlewood","doi":"10.1109/RTSS.2010.43","DOIUrl":"https://doi.org/10.1109/RTSS.2010.43","url":null,"abstract":"This paper is concerned with the development of reliable real-time systems for use in high integrity applications. It advocates the use of diverse replicated channels, but does not require the dependencies between the channels to be evaluated. Rather it develops and extends the approach of Little wood and Rush by (for general systems) by investigating a two channel system in which one channel, A, is produced to a high level of reliability (i.e. has a very low failure rate), while the other, B, employs various forms of static analysis to sustain an argument that it is perfect (i.e. it will never miss a deadline). The first channel is fully functional, the second contains a more restricted computational model and contains only the critical computations. Potential dependencies between the channels (and their verification) are evaluated in terms of aleatory and epistemic uncertainty. At the aleatory level the events ''A fails\" and ''B is imperfect\" are independent. Moreover, unlike the general case, independence at the epistemic level is also proposed for common forms of implementation and analysis for real-time systems and their temporal requirements (deadlines). As a result, a systematic approach is advocated that can be applied in a real engineering context to produce highly reliable real-time systems, and to support numerical claims about the level of reliability achieved.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124668477","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}
引用次数: 14
A Design Flow for Building Automation and Control Systems 楼宇自动化与控制系统的设计流程
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.26
Yang Yang, A. Pinto, A. Sangiovanni-Vincentelli, Qi Zhu
{"title":"A Design Flow for Building Automation and Control Systems","authors":"Yang Yang, A. Pinto, A. Sangiovanni-Vincentelli, Qi Zhu","doi":"10.1109/RTSS.2010.26","DOIUrl":"https://doi.org/10.1109/RTSS.2010.26","url":null,"abstract":"We propose a system-level design flow for building automation and control (BAC) systems. The input to the design flow is a high level description of the control algorithms given in a model-based environment such as Simulink. The input specification is translated into an intermediate format, and then automatically refined into a distributed implementation. Refinement includes optimal mapping of the functional specification on a set of computation and communication resources, and software synthesis, which generates code for each component in the mapped design while guaranteeing semantic equivalence with the original specification. Experiments with a temperature control system are presented to illustrate the flow.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124906135","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}
引用次数: 19
Optimizing Expected Time Utility in Cyber-Physical Systems Schedulers 优化网络物理系统调度程序的预期时间效用
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.28
T. Tidwell, R. Glaubius, C. Gill, W. Smart
{"title":"Optimizing Expected Time Utility in Cyber-Physical Systems Schedulers","authors":"T. Tidwell, R. Glaubius, C. Gill, W. Smart","doi":"10.1109/RTSS.2010.28","DOIUrl":"https://doi.org/10.1109/RTSS.2010.28","url":null,"abstract":"Classical scheduling abstractions such as deadlines and priorities do not readily capture the complex timing semantics found in many real-time cyber-physical systems. Time utility functions provide a necessarily richer description of timing semantics, but designing utility-aware scheduling policies using them is an open research problem. In particular, scheduling design that optimizes expected utility accrual is needed for real-time cyber-physical domains. In this paper we design scheduling policies that optimize expected utility accrual for cyber-physical systems with periodic, non-preemptable tasks that run with stochastic duration. These policies are derived by solving a Markov Decision Process formulation of the scheduling problem. We use this formulation to demonstrate that our technique improves on existing heuristic utility accrual scheduling policies.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131175250","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
Prolonging Sensor Network Lifetime Through Wireless Charging 通过无线充电延长传感器网络寿命
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.35
Yang Peng, Zi Li, Wensheng Zhang, D. Qiao
{"title":"Prolonging Sensor Network Lifetime Through Wireless Charging","authors":"Yang Peng, Zi Li, Wensheng Zhang, D. Qiao","doi":"10.1109/RTSS.2010.35","DOIUrl":"https://doi.org/10.1109/RTSS.2010.35","url":null,"abstract":"The emerging wireless charging technology is a promising alternative to address the power constraint problem in sensor networks. Comparing to existing approaches, this technology can replenish energy in a more controllable manner and does not require accurate location of or physical alignment to sensor nodes. However, little work has been reported on designing and implementing a wireless charging system for sensor networks. In this paper, we design such a system, build a proof-of-concept prototype, conduct experiments on the prototype to evaluate its feasibility and performance in small-scale networks, and conduct extensive simulations to study its performance in large-scale networks. Experimental and simulation results demonstrate that the proposed system can utilize the wireless charging technology effectively to prolong the network lifetime through delivering energy by a robot to where it is needed. The effects of various configuration and design parameters have also been studied, which may serve as useful guidelines in actual deployment of the proposed system in practice.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133251035","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}
引用次数: 306
Feedback Control of Cyber-physical Systems with Multi Resource Dependencies and Model Uncertainties 具有多资源依赖和模型不确定性的信息物理系统的反馈控制
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.14
Mikael Lindberg, Karl-Erik Årzén
{"title":"Feedback Control of Cyber-physical Systems with Multi Resource Dependencies and Model Uncertainties","authors":"Mikael Lindberg, Karl-Erik Årzén","doi":"10.1109/RTSS.2010.14","DOIUrl":"https://doi.org/10.1109/RTSS.2010.14","url":null,"abstract":"The problem of modeling and controlling resources in a system with interaction between hardware and software is considered. A model encompassing both hardware and software dynamics is developed together with an on-line estimation scheme in order reduce dependence on a-priori information. A control structure is presented in order to control performance under constrained resource situations and to reduce effects of estimation errors and disturbances. The approach is applied to a conversational video case and evaluated through simulations.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124824269","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}
引用次数: 30
LLF Schedulability Analysis on Multiprocessor Platforms 多处理器平台上的LLF可调度性分析
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.13
Jinkyu Lee, A. Easwaran, I. Shin
{"title":"LLF Schedulability Analysis on Multiprocessor Platforms","authors":"Jinkyu Lee, A. Easwaran, I. Shin","doi":"10.1109/RTSS.2010.13","DOIUrl":"https://doi.org/10.1109/RTSS.2010.13","url":null,"abstract":"LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms have been little studied until now. Orthogonally, it has remained open how to efficiently schedule general task systems, including constrained deadline task systems, upon multiprocessors. Recent studies have introduced zero laxity (ZL) policy, which assigns a higher priority to a task with zero laxity, as a promising scheduling approach for such systems (e.g., EDZL). Towards understanding the importance of laxity in multiprocessor scheduling, this paper investigates the characteristics of ZL policy and presents the first ZL schedulability test for any work-conserving scheduling algorithm that employs this policy. It then investigates the characteristics of LLF scheduling, which also employs the ZL policy, and derives the first LLF-specific schedulability test on multiprocessors. It is shown that the proposed LLF test dominates the ZL test as well as the state-of-art EDZL test.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683523","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}
引用次数: 31
Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams 使用约束矩阵图的全符号时间模型检查
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.36
Rüdiger Ehlers, D. Fass, M. Gerke, H. Peter
{"title":"Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams","authors":"Rüdiger Ehlers, D. Fass, M. Gerke, H. Peter","doi":"10.1109/RTSS.2010.36","DOIUrl":"https://doi.org/10.1109/RTSS.2010.36","url":null,"abstract":"We present constraint matrix diagrams (CMDs), a novel data structure for the fully symbolic reach ability analysis of timed automata. CMDs combine matrix-based and diagram-based state space representations generalizing the concepts of difference bound matrices (DBMs), clock difference diagrams (CDDs), and clock restriction diagrams (CRDs). The key idea is to represent convex parts of the state space as (partial) DBMs which are, in turn, organized in a CDD/CRD-like ordered and reduced diagram. The location information is incorporated as a special Boolean constraint in the matrices. We describe all CMD operations needed for the construction of the transition relation and the reach ability fixed point computation. Based on a prototype implementation, we compare our technique with the timed model checkers RED and Uppaal, and furthermore investigate the impact of two different reduced forms on the time and space consumption.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"148 Pt 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126319358","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}
引用次数: 19
Bounding the Number of Self-Blocking Occurrences of SIRAP 限制SIRAP的自阻塞次数
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.20
M. Behnam, Thomas Nolte, R. J. Bril
{"title":"Bounding the Number of Self-Blocking Occurrences of SIRAP","authors":"M. Behnam, Thomas Nolte, R. J. Bril","doi":"10.1109/RTSS.2010.20","DOIUrl":"https://doi.org/10.1109/RTSS.2010.20","url":null,"abstract":"This paper presents a new schedulability analysis for hierarchically scheduled real-time systems executing on a single processor using SIRAP, a synchronization protocol for inter subsystem task synchronization. We show that it is possible to bound the number of self-blocking occurrences that should be taken into consideration in the schedulability analysis of subsystems. Correspondingly, we present two novel schedulability analysis approaches with proof of correctness for SIRAP. An evaluation suggests that this new schedulability analysis can decrease the analytical subsystem utilization significantly.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132777243","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}
引用次数: 17
A Decentralized Approach for Monitoring Timing Constraints of Event Flows 事件流时间约束的分散监控方法
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.11
Hyoseung Kim, Shinyoung Yi, Wonwoo Jung, H. Cha
{"title":"A Decentralized Approach for Monitoring Timing Constraints of Event Flows","authors":"Hyoseung Kim, Shinyoung Yi, Wonwoo Jung, H. Cha","doi":"10.1109/RTSS.2010.11","DOIUrl":"https://doi.org/10.1109/RTSS.2010.11","url":null,"abstract":"This paper presents a run-time monitoring framework to detect end-to-end timing constraint violations of event flows in distributed real-time systems. The framework analyzes every event on possible event flow paths and automatically inserts timing fault checks for run-time detection. When the framework detects a timing violation, it provides users with the event flow's run-time path and the time consumption of each participating software module. In addition, it invokes a timing fault handler according to the timing fault specification, which allows our approach to aid the monitoring and management of the deployed systems. The experimental results show that the framework correctly detects timing constraint with insignificant overhead and provides related diagnostic information.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128126684","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}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信