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

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)最新文献

筛选
英文 中文
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks 传感器网络中均匀区域的分布式实时检测与跟踪
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.19
Sharmila Subramaniam, V. Kalogeraki, Themis Palpanas
{"title":"Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks","authors":"Sharmila Subramaniam, V. Kalogeraki, Themis Palpanas","doi":"10.1109/RTSS.2006.19","DOIUrl":"https://doi.org/10.1109/RTSS.2006.19","url":null,"abstract":"In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor network can help us to understand the field dynamics, and optimize the deployment of other solutions. We define a group of sensors having similar underlying distribution over a period of time as a homogeneous region. In this paper we propose distributed algorithms to detect such regions, approximate their boundary with a piece-wise linear curve and track the boundary in real-time. Experimental results show the accuracy and efficiency of our detection and tracking algorithms","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134163413","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}
引用次数: 28
User-Level Fine-Grained Adaptive Real-Time Scheduling via Temporal Reflection 通过时间反射的用户级细粒度自适应实时调度
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.50
S. Ruocco
{"title":"User-Level Fine-Grained Adaptive Real-Time Scheduling via Temporal Reflection","authors":"S. Ruocco","doi":"10.1109/RTSS.2006.50","DOIUrl":"https://doi.org/10.1109/RTSS.2006.50","url":null,"abstract":"Real-time systems must adapt their behaviour when the timing assumptions they are based on change at run time. A viable approach leading to effective adaptations consists of exploiting application-specific knowledge, but limitations of ordinary schedulers constrain its applicability. In this paper this problem is tackled using a reflective scheduler, which enables a computing system to perform temporal reflection, that is to fully observe and control its own temporal behaviour. The scheduler is implemented for the L4 microkernel, and validated by solving a real-time image analysis problem. Compared with other approaches the reflective scheduler is orders of magnitude more precise, achieving microsecond-level accuracy, while its implementation is entirely at user-level, and it does not require any changes to be made to the microkernel itself","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340740","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}
引用次数: 10
Programming Execution-Time Servers in Ada 2005 在Ada 2005中编程执行时服务器
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1145/1316003.1316012
A. Burns, A. Wellings
{"title":"Programming Execution-Time Servers in Ada 2005","authors":"A. Burns, A. Wellings","doi":"10.1145/1316003.1316012","DOIUrl":"https://doi.org/10.1145/1316003.1316012","url":null,"abstract":"Much of the research on scheduling schemes is prevented from being used in practice by the lack of implementations that provide the necessary abstractions. An example of this is the support of execution-time servers. Apart for a single mechanism (the sporadic server), which is defined in the POSIX standard, these important building blocks are not available to the system developer. Over the last few years, we have been developing the mechanisms necessary to construct execution-time servers from within an Ada context. Versions of these have now been incorporated in the Ada 2005 standard. In this paper, we show how the mechanisms can be used to construct the deferrable and sporadic servers","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125362005","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
Energy-Efficient Real-Time Task Scheduling for a DVS System with a Non-DVS Processing Element 具有非分布式交换机处理单元的分布式交换机系统节能实时任务调度
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.22
Chia-Mei Hung, Jian-Jia Chen, Tei-Wei Kuo
{"title":"Energy-Efficient Real-Time Task Scheduling for a DVS System with a Non-DVS Processing Element","authors":"Chia-Mei Hung, Jian-Jia Chen, Tei-Wei Kuo","doi":"10.1109/RTSS.2006.22","DOIUrl":"https://doi.org/10.1109/RTSS.2006.22","url":null,"abstract":"Multiple processing elements are often adopted in the current designs of embedded systems. Such configurations impose challenges on hardware/software co-designs with energy-efficient considerations. This paper targets energy-efficient real-time task scheduling of such popular configurations, in which systems are equipped with a DVS processor and a non-DVS processing element (PE). We consider task scheduling under different power consumption models of the non-DVS PE. When the power consumption of the non-DVS PE is independent on the assigned workload, a fully polynomial-time approximation scheme is developed for energy-efficient scheduling. When the energy consumption of the non-DVS PE depends on the assigned workload, a 0.5-approximation algorithm is developed to maximize the energy saving, compared to the execution of tasks on a DVS processor. Extensive simulations were performed to evaluate the capability of our proposed algorithms. The results show that our algorithms are very effective in energy-efficiency","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994743","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}
引用次数: 69
An Optimal Real-Time Scheduling Algorithm for Multiprocessors 一种多处理器实时调度优化算法
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.10
Hyeonjoong Cho, B. Ravindran, E. Jensen
{"title":"An Optimal Real-Time Scheduling Algorithm for Multiprocessors","authors":"Hyeonjoong Cho, B. Ravindran, E. Jensen","doi":"10.1109/RTSS.2006.10","DOIUrl":"https://doi.org/10.1109/RTSS.2006.10","url":null,"abstract":"We present an optimal real-time scheduling algorithm for multiprocessors $one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed based on a novel abstraction for reasoning about task execution behavior on multiprocessors: the time and local execution time domain plane (or T-L plane). LLREF is based on the fluid scheduling model and the fairness notion, and uses the T-L plane to describe fluid schedules without using time quanta, unlike the optimal Pfair algorithm (which uses time quanta). We show that scheduling for multiprocessors can be viewed as repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in the optimal schedule. We analytically establish the optimality of LLREF. Further, we establish that the algorithm has bounded overhead, and this bound is independent of time quanta (unlike Pfair). Our simulation results validate our analysis on the algorithm overhead","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122135468","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}
引用次数: 273
An Emprical Evaluation of Memory Management Alternatives for Real-Time Java 实时Java内存管理方案的经验评估
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.9
F. Pizlo, J. Vitek
{"title":"An Emprical Evaluation of Memory Management Alternatives for Real-Time Java","authors":"F. Pizlo, J. Vitek","doi":"10.1109/RTSS.2006.9","DOIUrl":"https://doi.org/10.1109/RTSS.2006.9","url":null,"abstract":"Memory management is a critical issue for correctness and performance of hard-real time systems. Java environments usually incorporate high-throughput garbage collection algorithms, but these algorithms can induce pause times in excess of 100 milliseconds. This is not acceptable for a real-time system. Two approaches for remedying this problem are being investigated. The pause times can be bounded with a real-time garbage collector; or a means to program around the collector entirely can be provided, as is done in the real-time specification for Java with its scoped memory interface. This paper presents the first side-by-side empirical evaluation of the impact of memory management regimes on realistic realtime applications. We present usability arguments as well as a detailed performance comparison of scoped memory and real-time garbage collection. Experience with medium sized systems suggests that while programming with scoped memory is error prone, it provides substantially better throughput. We have observed a throughput reduction of up to 37% and, in the worst-case, an 80% latency penalty for real-time garbage collection","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123027438","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
Parallel Real-Time Task Scheduling on Multicore Platforms 多核平台并行实时任务调度
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.32
James H. Anderson, J. Calandrino
{"title":"Parallel Real-Time Task Scheduling on Multicore Platforms","authors":"James H. Anderson, J. Calandrino","doi":"10.1109/RTSS.2006.32","DOIUrl":"https://doi.org/10.1109/RTSS.2006.32","url":null,"abstract":"We propose a scheduling method for real-time systems implemented on multicore platforms that encourages individual threads of multithreaded real-time tasks to be scheduled together. When such threads are cooperative and share a common working set, this method enables more effective use of on-chip shared caches","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133246111","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}
引用次数: 69
Prediction-Based QoS Management for Real-Time Data Streams 基于预测的实时数据流QoS管理
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.34
Yuan Wei, V. Prasad, S. Son, J. Stankovic
{"title":"Prediction-Based QoS Management for Real-Time Data Streams","authors":"Yuan Wei, V. Prasad, S. Son, J. Stankovic","doi":"10.1109/RTSS.2006.34","DOIUrl":"https://doi.org/10.1109/RTSS.2006.34","url":null,"abstract":"With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these systems have inherent timing constraints. Providing deadline guarantees for queries over dynamic data streams is a challenging problem due to bursty data stream arrival rates and time-varying stream contents. In this paper, we propose a prediction-based quality-of-service (QoS) management scheme for periodic queries over dynamic data streams. Our QoS management scheme features novel query workload estimators, which predict the query workload using execution time profiling and input data sampling, and adjusts the query QoS levels based on online query execution time prediction. We implement our QoS management algorithm on a real-time data stream query system prototype called RTStream. Our experimental evaluation of the scheme shows that our query workload estimator performs very well even with workload fluctuations and our QoS management scheme yields better overall system utility than the existing approaches for QoS management","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130143030","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}
引用次数: 52
Determining Maximum Stack Usage in Preemptive Shared Stack Systems 确定抢占式共享堆栈系统中的最大堆栈使用率
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.18
Kaj Hänninen, Jukka Mäki-Turja, M. Bohlin, Jan Carlson, Mikael Nolin
{"title":"Determining Maximum Stack Usage in Preemptive Shared Stack Systems","authors":"Kaj Hänninen, Jukka Mäki-Turja, M. Bohlin, Jan Carlson, Mikael Nolin","doi":"10.1109/RTSS.2006.18","DOIUrl":"https://doi.org/10.1109/RTSS.2006.18","url":null,"abstract":"This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We provide a general and exact problem formulation applicable for any preemptive system model based on dynamic (run-time) properties. We also show how to safely approximate the exact stack usage by using static (compile time) information about the system model and the underlying run-time system on a relevant and commercially available system model: a hybrid, statically and dynamically, scheduled system. Comprehensive evaluations show that our technique significantly reduces the amount of stack memory needed compared to existing analysis techniques. For typical task sets a decrease in the order of 70% is typical","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123878375","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
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks 簇树无线传感器网络的建模与最坏情况维数
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.29
A. Koubâa, M. Alves, E. Tovar
{"title":"Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks","authors":"A. Koubâa, M. Alves, E. Tovar","doi":"10.1109/RTSS.2006.29","DOIUrl":"https://doi.org/10.1109/RTSS.2006.29","url":null,"abstract":"Time-sensitive wireless sensor network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case dimensioning of cluster-tree WSNs. We provide a fine model of the worst-case cluster-tree topology characterized by its depth, the maximum number of child routers and the maximum number of child nodes for each parent router. Using Network Calculus, we derive \"plug-and-play \" expressions for the end-to-end delay bounds, buffering and bandwidth requirements as a function of the WSN cluster-tree characteristics and traffic specifications. The cluster-tree topology has been adopted by many cluster-based solutions for WSNs. We demonstrate how to apply our general results for dimensioning IEEE 802.15.4/Zigbee cluster-tree WSNs. We believe that this paper shows the fundamental performance limits of cluster-tree wireless sensor networks by the provision of a simple and effective methodology for the design of such WSNs","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"97 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113954910","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}
引用次数: 165
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信