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

筛选
英文 中文
Quality-Driven Volcanic Earthquake Detection Using Wireless Sensor Networks 利用无线传感器网络进行质量驱动的火山地震探测
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.21
R. Tan, G. Xing, Jinzhu Chen, Wenzhan Song, Renjie Huang
{"title":"Quality-Driven Volcanic Earthquake Detection Using Wireless Sensor Networks","authors":"R. Tan, G. Xing, Jinzhu Chen, Wenzhan Song, Renjie Huang","doi":"10.1109/RTSS.2010.21","DOIUrl":"https://doi.org/10.1109/RTSS.2010.21","url":null,"abstract":"Volcano monitoring is of great interest to public safety and scientific explorations. However, traditional volcanic instrumentation such as broadband seismometers are expensive, power-hungry, bulky, and difficult to install. Wireless sensor networks (WSNs) offer the potential to monitor volcanoes at unprecedented spatial and temporal scales. However, current volcanic WSN systems often yield poor monitoring quality due to the limited sensing capability of low-cost sensors and unpredictable dynamics of volcanic activities. Moreover, they are designed only for short-term monitoring due to the high energy consumption of centralized data collection. In this paper, we propose a novel quality-driven approach to achieving real-time, in-situ, and long-lived volcanic earthquake detection. By employing novel in-network collaborative signal processing algorithms, our approach can meet stringent requirements on sensing quality (low false alarm/missing rate and precise earthquake onset time) at low power consumption. We have implemented our algorithms in TinyOS and conducted extensive evaluation on a testbed of 24 TelosB motes as well as simulations based on real data traces collected during 5.5 months on an active volcano. We show that our approach yields near-zero false alarm/missing rate and less than one second of detection delay while achieving up to 6-fold energy reduction over the current data collection approach.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"76 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":"127549652","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}
引用次数: 93
On Structural Robustness of Distributed Real-Time Systems Towards Uncertainties in Service Times 分布式实时系统对服务时间不确定性的结构鲁棒性研究
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.9
P. Jayachandran, T. Abdelzaher
{"title":"On Structural Robustness of Distributed Real-Time Systems Towards Uncertainties in Service Times","authors":"P. Jayachandran, T. Abdelzaher","doi":"10.1109/RTSS.2010.9","DOIUrl":"https://doi.org/10.1109/RTSS.2010.9","url":null,"abstract":"As real-time systems are becoming increasingly distributed, it becomes important to understand their structural robustness with respect to timing uncertainty. Structural robustness, a concept that arises by virtue of multi-stage execution, refers to the robustness of end-to-end timing behavior of an execution graph towards unexpected timing violations in individual execution stages. A robust topology is one where such violations minimally affect end-to-end execution delay. The paper shows that the manner in which resources are allocated to execution stages can make a difference in robustness. Algorithms are presented and evaluated for resource allocation that improve the robustness of execution graphs. Evaluation shows that such algorithms are able to significantly reduce deadline misses due to unpredictable timing violations. Hence, the approach is important for soft real-time systems, systems where timing uncertainty exists, or where worst-case timing is not entirely verified.","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":"124470913","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}
引用次数: 2
Supporting Soft Real-Time DAG-Based Systems on Multiprocessors with No Utilization Loss 支持无损耗的多处理器软实时dag系统
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.38
Cong Liu, James H. Anderson
{"title":"Supporting Soft Real-Time DAG-Based Systems on Multiprocessors with No Utilization Loss","authors":"Cong Liu, James H. Anderson","doi":"10.1109/RTSS.2010.38","DOIUrl":"https://doi.org/10.1109/RTSS.2010.38","url":null,"abstract":"In work on globally-scheduled real-time multiprocessor systems, analysis is lacking for supporting real-time applications developed using general processing graph models. In this paper, it is shown that bounded deadline tardiness can be ensured for such applications on a multiprocessor with no utilization loss. This result is general: it is applicable to periodic, sporadic, and rate-based directed-acyclic-graph (DAG) models and allows sophisticated notions of precedence to be supported (particularly, notions allowed by the processing graph method). This paper is the first to show that bounded tardiness can be ensured for globally-scheduled DAG-based applications without utilization loss.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"126 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":"131675386","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}
引用次数: 39
End-to-End Delay Bound for Prioritized Data Flows in Disruption-Tolerant Networks 容中断网络中优先数据流的端到端延迟约束
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.39
Md Yusuf Sarwar Uddin, F. Saremi, T. Abdelzaher
{"title":"End-to-End Delay Bound for Prioritized Data Flows in Disruption-Tolerant Networks","authors":"Md Yusuf Sarwar Uddin, F. Saremi, T. Abdelzaher","doi":"10.1109/RTSS.2010.39","DOIUrl":"https://doi.org/10.1109/RTSS.2010.39","url":null,"abstract":"This paper computes end-to-end delay bounds for prioritized data flows in disruption-tolerant networks (DTNs). DTNs suffer intermittent connectivity among nodes due to node mobility. When deployed in mission-critical applications, such as disaster response, an interesting question becomes to quantify end-to-end packet delays under assumptions on node mobility. In this paper, we answer this question for the special case of DTNs with recurrent mobility patterns. A recurrent pattern refers to one where nodes revisit the same locations repeatedly. We devise a suitable model for recurrent DTNs that captures their timing and mobility properties. We then apply the recently proposed delay composition algebra to the resulting network model in order to determine an upper bound on end-to-end communication delays of network flows. Evaluation results show that the upper bound is moderate in its pessimism and can be used for deployment planning purposes.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"78 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":"117238027","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}
引用次数: 8
Quality Tradeoffs in Object Tracking with Duty-Cycled Sensor Networks 基于占空比传感器网络的目标跟踪质量权衡
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.24
S. Zahedi, M. Srivastava, C. Bisdikian, Lance M. Kaplan
{"title":"Quality Tradeoffs in Object Tracking with Duty-Cycled Sensor Networks","authors":"S. Zahedi, M. Srivastava, C. Bisdikian, Lance M. Kaplan","doi":"10.1109/RTSS.2010.24","DOIUrl":"https://doi.org/10.1109/RTSS.2010.24","url":null,"abstract":"Extending the lifetime of wireless sensor networks requires energy-conserving operations such as duty-cycling. However, such operations may impact the effectiveness of high fidelity real-time sensing tasks, such as object tracking, which require high accuracy and short response times. In this paper, we quantify the influence of different duty-cycle schemes on the efficiency of bearings-only object tracking. Specifically, we use the Maximum Likelihood localization technique to analyze the accuracy limits of object location estimates under different response latencies considering variable network density and duty-cycle parameters. Moreover, we study the tradeoffs between accuracy and response latency under various scenarios and motion patterns of the object. We have also investigated the effects of different duty-cycled schedules on the tracking accuracy using acoustic sensor data collected at Aberdeen Proving Ground, Maryland, by the U.S. Army Research Laboratory (ARL).","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"29 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":"130219357","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}
引用次数: 22
Scheduling Parallel Real-Time Tasks on Multi-core Processors 在多核处理器上调度并行实时任务
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.42
Karthik Lakshmanan, S. Kato, R. Rajkumar
{"title":"Scheduling Parallel Real-Time Tasks on Multi-core Processors","authors":"Karthik Lakshmanan, S. Kato, R. Rajkumar","doi":"10.1109/RTSS.2010.42","DOIUrl":"https://doi.org/10.1109/RTSS.2010.42","url":null,"abstract":"Massively multi-core processors are rapidly gaining market share with major chip vendors offering an ever increasing number of cores per processor. From a programming perspective, the sequential programming model does not scale very well for such multi-core systems. Parallel programming models such as OpenMP present promising solutions for more effectively using multiple processor cores. In this paper, we study the problem of scheduling periodic real-time tasks on multiprocessors under the fork join structure used in OpenMP. We illustrate the theoretical best-case and worst-case periodic fork-join task sets from a processor utilization perspective. Based on our observations of these task sets, we provide a partitioned preemptive fixed-priority scheduling algorithm for periodic fork-join tasks. The proposed multiprocessor scheduling algorithm is shown to have a resource augmentation bound of 3.42, which implies that any task set that is feasible on m unit speed processors can be scheduled by the proposed algorithm on m processors that are 3:42 times faster.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"308 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":"115023785","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}
引用次数: 269
Scheduling for Fault-Tolerant Communication on the Static Segment of FlexRay FlexRay静态网段容错通信调度
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.31
Bogdan Tanasa, Unmesh D. Bordoloi, P. Eles, Zebo Peng
{"title":"Scheduling for Fault-Tolerant Communication on the Static Segment of FlexRay","authors":"Bogdan Tanasa, Unmesh D. Bordoloi, P. Eles, Zebo Peng","doi":"10.1109/RTSS.2010.31","DOIUrl":"https://doi.org/10.1109/RTSS.2010.31","url":null,"abstract":"FlexRay has been widely accepted as the next generation bus protocol for automotive networks. This has led to tremendous research interest in techniques for scheduling messages on the FlexRay bus, in order to meet the hard real-time deadlines of the automotive applications. However, these techniques do not generate reliable schedules in the sense that they do not provide any performance guarantees in the presence of faults. In this work, we will present a framework for generating fault-tolerant message schedules on the time-triggered (static) segment of the FlexRay bus. We provide formal guarantees that the generated fault-tolerant schedules achieve the reliability goal even in the presence of transient and intermittent faults. Moreover, our technique minimizes the required number of re-transmissions of the messages in order to achieve such fault tolerant schedules, thereby, optimizing the bandwidth utilization. Towards this, we formulate the optimization problem in Constraint Logic Programming (CLP), which returns optimal results. However, this procedure is computationally intensive and hence, we also propose an efficient heuristic. The heuristic guarantees the reliability of the constructed schedules but might be sub-optimal with respect to bandwidth utilization. Extensive experiments run on synthetic test cases and real-life case studies illustrate that the heuristic performs extremely well. The experiments also establish that our heuristic scales significantly better than the CLP formulation.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"104 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":"134046000","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}
引用次数: 45
Optimal Schedules for Sensor Network Queries 传感器网络查询的最优调度
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.37
S. Gopalakrishnan
{"title":"Optimal Schedules for Sensor Network Queries","authors":"S. Gopalakrishnan","doi":"10.1109/RTSS.2010.37","DOIUrl":"https://doi.org/10.1109/RTSS.2010.37","url":null,"abstract":"We examine optimal strategies for querying a sensor network when energy efficiency and data freshness need to be balanced. We use statistical information about the nature of events monitored by the sensor network to develop good query schedules. For Poisson event arrivals, we develop an optimal scheduling strategy that is actually a periodic querying policy. For hyper exponential distribution of event inter-arrival times, we discuss an optimal policy, and suggest sub optimal schemes because of the high computational cost imposed by the optimal scheme. We treat the sensor network like a black box that has (primarily energy) costs associated with various operations and suggest that this is indeed feasible, as a consequence the higher-level policies that we discuss for scheduling queries can be realized easily.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"26 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":"134584942","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
Optimality Results for Multiprocessor Real-Time Locking 多处理器实时锁定的最优结果
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.17
Björn B. Brandenburg, James H. Anderson
{"title":"Optimality Results for Multiprocessor Real-Time Locking","authors":"Björn B. Brandenburg, James H. Anderson","doi":"10.1109/RTSS.2010.17","DOIUrl":"https://doi.org/10.1109/RTSS.2010.17","url":null,"abstract":"When locking protocols are used in real-time systems, bounds on blocking times are required when ensuring timing constraints. While the term “blocking” is well-understood in the context of uniprocessor real-time systems, the same is not true in the multiprocessor case. In this paper, two definitions of blocking are presented that are applicable to suspension-based multiprocessor locking protocols. The need for two definitions arises because of differences in how suspensions are handled in existing schedulability analysis. For each definition, locking protocols are presented that have asymptotically optimal blocking behavior. In particular, protocols are presented for any job-level static-priority global or partitioned scheduling algorithm.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"211 2 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":"122454668","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}
引用次数: 146
Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules 在多处理器优化实时调度中最小化任务抢占和迁移
2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.22
T. Megel, Renaud Sirdey, V. David
{"title":"Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules","authors":"T. Megel, Renaud Sirdey, V. David","doi":"10.1109/RTSS.2010.22","DOIUrl":"https://doi.org/10.1109/RTSS.2010.22","url":null,"abstract":"We present a new approach to decrease task preemptions and migrations in optimal global real-time schedules on symmetric multiprocessors. Contrary to classical approaches, our method proceeds in two steps, one off-line to place jobs on intervals and one on-line to schedule them dynamically inside each interval. We propose a new linear programming formulation and a local scheduler which exhibits low complexity and produces few task preemptions and migrations. We compare our approach with other optimal scheduling algorithms, using the implicit-deadline periodic task model. Simulation results illustrate the competitiveness of our approach with respect to task preemptions and migrations.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"34 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":"114758097","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
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学术官方微信