Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.最新文献

Dynamic CPU management for real-time, middleware-based systems 用于实时、基于中间件的系统的动态CPU管理

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-28 DOI: 10.1109/RTTAS.2004.1317274

E. Eide, Tim Stack, J. Regehr, Jay Lepreau

{"title":"Dynamic CPU management for real-time, middleware-based systems","authors":"E. Eide, Tim Stack, J. Regehr, Jay Lepreau","doi":"10.1109/RTTAS.2004.1317274","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317274","url":null,"abstract":"Many real-world distributed, real-time, embedded (ORE) systems, such as multiagent military applications, are built using commercially available operating systems, middleware, and collections of pre-existing software. The complexity of these systems makes it difficult to ensure that they maintain high quality of service (QOS). At design time, the challenge is to introduce coordinated QOS controls into multiple software elements in a non-invasive manner. At run time, the system must adapt dynamically to maintain high QOS in the face of both expected events, such as application mode changes, and unexpected events, such as resource demands from other applications. We describe the design and implementation of a CPU broker for these types of ORE systems. The CPU broker mediates between multiple real-time tasks and the facilities of a real-time operating system: using feedback and other inputs, it adjusts allocations over tune to ensure that high application-level QOS is maintained. The broker connects to its monitored tasks in a non-invasive manner, is based on and integrated with industry-standard middleware, and implements an open architecture for new CPU management policies. Moreover, these features allow the broker to be easily combined with other QOS mechanisms and policies, as part of an overall end-to-end QOS management system. We describe our experience in applying the CPU Broker to a simulated DUE military system. Our results show that the broker connects to the system transparently and allows it to function in the face of run-time CPU resource contention.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195210","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}

引用次数: 51

Adaptive resource allocation control with on-line search for fair QoS level 在线搜索公平QoS水平的自适应资源分配控制

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317281

Fumiko Harada, T. Ushio, Y. Nakamoto

引用次数: 7

Data management in real-time systems: a case of on-demand updates in vehicle control systems 实时系统中的数据管理:车辆控制系统中按需更新的案例

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317263

T. Gustafsson, J. Hansson

引用次数: 64

A wakeup scheme for sensor networks: achieving balance between energy saving and end-to-end delay 一种传感器网络唤醒方案:实现节能与端到端时延的平衡

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317245

Xue Yang, N. Vaidya

引用次数: 224

Disseminating dynamic data with QoS guarantee in a wide area network: a practical control theoretic approach 在广域网中传播具有QoS保证的动态数据:一种实用的控制理论方法

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317298

R. Majumdar, K. Ramamritham, R. Banavar, K. Moudgalya

{"title":"Disseminating dynamic data with QoS guarantee in a wide area network: a practical control theoretic approach","authors":"R. Majumdar, K. Ramamritham, R. Banavar, K. Moudgalya","doi":"10.1109/RTTAS.2004.1317298","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317298","url":null,"abstract":"Often, data used in online decision making (for example, in determining how to react to changes in process behavior, traffic flow control, etc.) is dynamic in nature and hence the timeliness of the data delivered to the decision making process becomes very important. The delivered data must conform to certain time or value based application specific consistency requirements. The design of mechanisms for such data delivery is challenging given that dynamic data changes rapidly and unpredictably, the latter making it very hard to use simple prediction techniques. To address these challenges we develop mechanisms to obtain timely and consistency-preserving updates for dynamic data by pulling data from the source at strategically chosen points in time, providing quality of service (QoS) guarantees. Motivated by the need for practical system design, but using formal analytical techniques, we offer a systematic approach based on control-theoretic principles. We present a stochastic controller based on the linear quadratic Gaussian (LQG) technique as a means for deciding when to next refresh data from a source. A simple enhancement of the LQG algorithm allows us to provide QoS guarantees. Using real-world traces of real-time data we show the superior performance of our feedback-driven control-theoretic approach by comparing with a previously proposed adaptive refresh technique, a pattern matching technique, and a proportional controller with dynamically changing tuning criteria.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116054401","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}

引用次数: 11

Proposal and evaluation for organising and using available data for software performance estimations in embedded platform development 在嵌入式平台开发中组织和使用可用数据进行软件性能评估的建议和评估

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317260

E. Johansson, Fredrik Wartenberg

引用次数: 6

Feedback EDF scheduling exploiting dynamic voltage scaling 利用动态电压缩放的反馈EDF调度

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317252

Yifan Zhu, F. Mueller

{"title":"Feedback EDF scheduling exploiting dynamic voltage scaling","authors":"Yifan Zhu, F. Mueller","doi":"10.1109/RTTAS.2004.1317252","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317252","url":null,"abstract":"Dynamic voltage scaling (DVS) is a promising method for embedded systems to exploit multiple voltage and frequency levels and to prolong battery life. However, pure DVS techniques do not perform well for systems with dynamic workloads where the job execution times vary significantly. We present a novel approach combining feedback control with DVS schemes targeting hard real-time systems with dynamic workloads. Our method relies strictly on operating system support by integrating a DVS scheduler and a feedback controller within the EDF scheduling algorithm. Each task is divided into two portions. Within the first portion, the objective is to exploit frequency scaling for the average execution time. We reserve enough time for the second portion to meet the deadline requirements up to the worst-case execution time following a last-chance approach. Feedback techniques make the system capable to select the right frequency and voltage settings for the first potion, as well as guaranteeing hard real-time requirements for the overall task. Simulation experiments demonstrate the ability of our algorithm to save up to 29% more energy than previous work for task sets with different dynamic workload characteristics.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123889928","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}

引用次数: 171

Adaptive routing of QoS-constrained media streams over scalable overlay topologies 可扩展覆盖拓扑上qos约束媒体流的自适应路由

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317299

Gerald Fry, R. West

{"title":"Adaptive routing of QoS-constrained media streams over scalable overlay topologies","authors":"Gerald Fry, R. West","doi":"10.1109/RTTAS.2004.1317299","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317299","url":null,"abstract":"Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, we investigate the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 40%, compared to approaches that do not consider physical link costs. Additionally, we discuss an approach that dynamically repositions nodes in logical space, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115903411","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

Incorporating cost of control into the design of a load balancing controller 将控制成本纳入负载平衡控制器的设计

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317284

Y. Diao, J. Hellerstein, Adam J. Storm, M. Surendra, S. Lightstone, S. Parekh, Christian Garcia-Arellano

{"title":"Incorporating cost of control into the design of a load balancing controller","authors":"Y. Diao, J. Hellerstein, Adam J. Storm, M. Surendra, S. Lightstone, S. Parekh, Christian Garcia-Arellano","doi":"10.1109/RTTAS.2004.1317284","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317284","url":null,"abstract":"Load balancing is widely used in computing systems as a way to optimize performance by reducing bottleneck utilizations, such as adjusting the size of buffer pools to balance resource demands in a database management system. Load balancing is generally approached as a constrained optimization problem in which only the benefits of load balancing are considered. However, the costs of control are important as well. Herein, we study the value of including in controller design the trade-off between the cost of transient imbalances in resource utilizations and the cost of changing resource allocations. An example of the latter are actions such as resizing buffer pools that can reduce throughputs. This is because requests for data in pools whose memory is reduced immediately have longer access times whereas requests for data in pools whose memory is increased must fill this memory with data from disk before accessed times are reduced. We frame our study of control costs in terms of the widely used linear quadratic regulator (LQR). We develop a cost model that allows us to specify the LQR Q and R matrices based on the impact on system performance of changing resource allocations and transient load imbalances. Our studies of a DB2 universal database server using benchmarks for online transaction processing and decision support workloads show that incorporating our cost model into the MIMO LQR controller results in a 14% improvement in performance beyond that achieved by dynamically allocating the size of buffers without properly considering the cost of control.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124265825","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}

引用次数: 43

FAIR: fee arbitrated incentive architecture in wireless ad hoc networks 公平:无线自组织网络中费用仲裁激励架构

Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. Pub Date : 2004-05-25 DOI: 10.1109/RTTAS.2004.1317247

A. Mok, Bina Mistry, Eric Chung, Baochun Li

{"title":"FAIR: fee arbitrated incentive architecture in wireless ad hoc networks","authors":"A. Mok, Bina Mistry, Eric Chung, Baochun Li","doi":"10.1109/RTTAS.2004.1317247","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317247","url":null,"abstract":"In ad hoc wireless networks, nodes communicate through a cooperative network in which other nodes function as relays. Since resources are frequently constrained, incentives must be provided to entice nodes to relay. The correct amount of incentive is essential to the efficient and optimal operation of the network. Excessive incentive results in widespread altruism, leading to diminished system lifetime. In contrast, insufficient incentive leads to selfish nodes that dramatically decrease network throughput. Nodes are assumed to be rational, and seek to maximize their own utilities. We use virtual credits as the incentive to stimulate cooperative behavior between nodes. The result of this research is fee arbitrated incentive architecture (FAIR), an application layer protocol that enhances fairness and collaboration in ad hoc wireless networks. FAIR utilizes autonomous feedback mechanisms to configure itself to the changing demands of the nodes, users, and network conditions. PriceSim, a network simulator implementing the FAIR protocol, was created to evaluate FAIR's performance.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127146681","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