2010 31st IEEE Real-Time Systems Symposium最新文献_第2页

Fidelity-Aware Utilization Control for Cyber-Physical Surveillance Systems 网络物理监控系统的保真度感知利用控制

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.40

Jinzhu Chen, R. Tan, G. Xing, Xiaorui Wang, Xing Fu

{"title":"Fidelity-Aware Utilization Control for Cyber-Physical Surveillance Systems","authors":"Jinzhu Chen, R. Tan, G. Xing, Xiaorui Wang, Xing Fu","doi":"10.1109/RTSS.2010.40","DOIUrl":"https://doi.org/10.1109/RTSS.2010.40","url":null,"abstract":"Recent years have seen the growing deployments of Cyber-Physical Systems (CPSs) in many mission-critical applications such as security, civil infrastructure, and transportation. These applications often impose stringent requirements on system sensing fidelity and timeliness. However, existing approaches treat these two concerns in isolation and hence are not suitable for CPSs where system fidelity and timeliness are dependent of each other because of the tight integration of computational and physical resources. In this paper, we propose a holistic approach called Fidelity-Aware Utilization Controller (FAUC) for Wireless Cyber-physical Surveillance (WCS) systems that combine low-end sensors with cameras for large-scale ad hoc surveillance in unplanned environments. By integrating data fusion with feedback control, FAUC can enforce a CPU utilization upper bound to ensure the system's real-time schedulability although CPU workloads vary significantly at runtime because of stochastic detection results. At the same time, FAUC optimizes system fidelity and adjusts the control objective of CPU utilization adaptively in the presence of variations of target/noise characteristics. We have implemented FAUC on a small-scale WCS testbed consisting of TelosB/Iris motes and cameras. Our extensive experiments on light and acoustic target detection show that FAUC can achieve robust fidelity and real-time guarantees in dynamic environments.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"58 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":"122404341","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

Memory-Aware Optimal Scheduling with Communication Overhead Minimization for Streaming Applications on Chip Multiprocessors 芯片多处理器上流应用的通信开销最小化的内存感知优化调度

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.16

Yi Wang, Duo Liu, Zhiwei Qin, Z. Shao

引用次数: 10

LISTEN: Non-interactive Localization in Wireless Camera Sensor Networks 听:无线相机传感器网络中的非交互式定位

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.15

Yuan He, Xingfa Shen, Yunhao Liu, Lufeng Mo, Guojun Dai

引用次数: 3

Overloading an IEEE 802.15.4 Point-to-Point Connection with Real-Time Messages 带实时消息的IEEE 802.15.4点对点连接过载

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.34

Marc Aoun, P. V. D. Stok

引用次数: 2

The Non-cyclic Recurring Real-Time Task Model 非循环循环实时任务模型

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.19

Sanjoy Baruah

引用次数: 54

Adaptive Voice Stream Multicast Over Low-Power Wireless Networks 基于低功耗无线网络的自适应语音流多播

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.27

Liqun Li, G. Xing, Qi Han, Limin Sun

{"title":"Adaptive Voice Stream Multicast Over Low-Power Wireless Networks","authors":"Liqun Li, G. Xing, Qi Han, Limin Sun","doi":"10.1109/RTSS.2010.27","DOIUrl":"https://doi.org/10.1109/RTSS.2010.27","url":null,"abstract":"Low-power Wireless Networks (LWNs) have become increasingly available for mission-critical applications such as security surveillance and disaster response. In particular, emerging low-power wireless audio platforms provide an economical solution for ad hoc voice communication in emergency scenarios. In this paper, we develop a system called Adaptive Stream Multicast (ASM) for voice communication over multi-hop LWNs. ASM is composed of several novel components specially designed to deliver robust voice quality for multiple sinks in dynamic environments: 1) an empirical model to automatically evaluate the voice quality perceived at sinks based on current network condition, 2) a feedback-based Forward Error Correction scheme where the source can adapt its coding redundancy ratio dynamically in response to the voice quality variation at sinks, 3) a Tree-based Opportunistic Routing (TOR) protocol that fully exploits the broadcast opportunities on a tree based on novel forwarder selection and coordination rules, and 4) a distributed admission control algorithm that ensures the voice quality guarantees when admitting new voice streams. ASM has been implemented on a low-power hardware platform and extensively evaluated through experiments on a testbed of 18 nodes.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"525 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":"127628020","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

Lightweight Extraction of Frequent Spatio-Temporal Activities from GPS Traces GPS轨迹中频繁时空活动的轻量级提取

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.33

Athanasios Bamis, A. Savvides

引用次数: 21

A Framework for Hierarchical Scheduling on Multiprocessors: From Application Requirements to Run-Time Allocation 多处理器层次调度框架:从应用需求到运行时分配

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.12

G. Lipari, Enrico Bini

{"title":"A Framework for Hierarchical Scheduling on Multiprocessors: From Application Requirements to Run-Time Allocation","authors":"G. Lipari, Enrico Bini","doi":"10.1109/RTSS.2010.12","DOIUrl":"https://doi.org/10.1109/RTSS.2010.12","url":null,"abstract":"Hierarchical scheduling is a promising methodology for designing and deploying real-time applications, since it enables component-based design and analysis, and supports temporal isolation among competing applications. In hierarchical scheduling an application is described by means of a temporal interface. The designer faces the problem of how to derive the interface parameters so to make the application schedulable, at the same time minimizing the waste of computational resources. The problem is particularly relevant in multiprocessor systems, where it is not clear yet how the interface parameters influence the schedulability of the application and allocation on the physical platform. In this paper we present three novel contributions to hierarchical scheduling for multiprocessor systems. First, we propose the Bounded-Delay Multipartition (BDM), a new interface specification model that allows the designer to balance resource usage versus flexibility in selecting the virtual platform parameters. Second, we explore the schedulability region of a real-time application on top of a generic virtual platform, and derive the interface parameter. Finally, we propose Fluid Best-Fit, an algorithm that takes advantage of the extra degree of flexibility provided by the BDM to compute the virtual platform parameters and allocate it on the physical platform. The performance of the algorithm is evaluated by simulations.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"131 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":"133981216","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}

引用次数: 67

An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks 基于smt的时间触发多跳网络调度综合评价

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.25

W. Steiner

{"title":"An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks","authors":"W. Steiner","doi":"10.1109/RTSS.2010.25","DOIUrl":"https://doi.org/10.1109/RTSS.2010.25","url":null,"abstract":"Networks for real-time systems have stringent end-to-end latency and jitter requirements. One cost-efficient way to meet these requirements is the time-triggered communication paradigm which plans the transmission points in time of the frames off-line. This plan prevents contentions of frames on the network and is called a time-triggered schedule (tt-schedule). In general the tt-scheduling is a bin-packing problem, known to be NP-complete, where the complexity is mostly driven by the freedom in topology of the network, its associated hardware restrictions, and application-imposed constraints. Multi-hop networks, in particular, require the synthesis of path-dependent tt-schedules to maintain full determinism of time-triggered communication from sender to receiver. Our experiments using the YICES SMT solver show that the scheduling problem can be solved by YICES out-of-the-box for a few hundred random frame instances on the network. A customized tt-scheduler using YICES as a back-end solver allows to increase this number of frame instances up to tens of thousands. In terms of scheduling quality, the synthesis produces up to ninety percent maximum utilization on a communication link with schedule synthesis times of about half an hour for the biggest examples we have studied. As a nice side-effect the YICES out-of-the-box approach is immediately applicable for the verification of existing (even large-scale) tt-schedules and for debugging more sophisticated tt-schedulers.","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":"116665166","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}

引用次数: 256

Dynamic Scheduling and Control-Quality Optimization of Self-Triggered Control Applications 自触发控制应用的动态调度与控制质量优化

2010 31st IEEE Real-Time Systems Symposium Pub Date : 2010-11-30 DOI: 10.1109/RTSS.2010.10

Soheil Samii, P. Eles, Zebo Peng, P. Tabuada, A. Cervin

引用次数: 30