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

筛选
英文 中文
The design and implementation of real-time CORBA 2.0: dynamic scheduling in TAO 实时CORBA 2.0的设计与实现:TAO中的动态调度
Yamuna Krishnamurthy, Irfan Pyarali, C. Gill, Louis Mgeta, Yuanfang Zhang, Stephen Torri, D. Schmidt
{"title":"The design and implementation of real-time CORBA 2.0: dynamic scheduling in TAO","authors":"Yamuna Krishnamurthy, Irfan Pyarali, C. Gill, Louis Mgeta, Yuanfang Zhang, Stephen Torri, D. Schmidt","doi":"10.1109/RTTAS.2004.1317256","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317256","url":null,"abstract":"In an emerging class of open distributed real-time and embedded (DRE) systems with stringent but dynamic QoS requirements, there is a need to propagate QoS parameters and enforce task QoS requirements across multiple endsystems in a way that is simultaneously efficient and adaptable. The object management group's (OMG) real-time CORBA 2.0 specification (RTC2) defines a dynamic scheduling framework for propagating and enforcing QoS parameters dynamically in standard CORBA middleware. We make two contributions to research on middleware for open DRE systems. First, it describes the design and capabilities of the RTC2 dynamic scheduling framework provided by TAO, which is our open-source CORBA standards-based object request broker (ORB). Second, it describes and summarize the results of empirical studies we have conducted to validate our RTC2 framework in the context of open DRE systems. The results of those experiments show that a range of policies for adaptive scheduling and management of distributable threads can be enforced efficiently in standard middleware for open DRE systems.","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":"130876578","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}
引用次数: 27
Coordinated search and track by multiple phased array radars 由多个相控阵雷达协同搜索和跟踪
Phil-Su Kang, Chang-Gun Lee
{"title":"Coordinated search and track by multiple phased array radars","authors":"Phil-Su Kang, Chang-Gun Lee","doi":"10.1109/RTTAS.2004.1317268","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317268","url":null,"abstract":"This paper addresses the search and track coordination problems of multiple shipboard radars. The proposed approach first exploits the physical characteristics of a single phased array radar to improve its effective capacity. Its effective capacity is abstracted by a closed-form equation called a schedulability envelope. Using the schedulability envelope for each radar, we deal with search and track coordination as a relative-load-balancing problem in a multiresource environment. The simulation results show that the proposed approach significantly improves the overall capacity of a multiship multiradar system.","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":"121482744","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
Feedback-based real-time scheduling in autonomous vehicle systems 基于反馈的自动驾驶车辆实时调度
Suzhen Lin, G. Manimaran, B. Steward
{"title":"Feedback-based real-time scheduling in autonomous vehicle systems","authors":"Suzhen Lin, G. Manimaran, B. Steward","doi":"10.1109/RTTAS.2004.1317277","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317277","url":null,"abstract":"The use of feedback control techniques has been gaining importance in the context of scheduling in real-time systems as a means to provide predictable performance in the face of uncertain workload. We propose a novel feedback-based scheduling approach for task scheduling in real-time systems. We focus on a system with a mobile node, where the mobility characteristics affect task parameters. The objective is to achieve low miss ratio and high CPU utilization. This objective is achieved by feeding back system performances and adapting the node' mobility parameters. We study the new approach in a selective herbicide spraying problem in the agricultural production wherein the speed of an autonomous vehicle (and hence task parameters) is adapted based on weed distribution in the given farm field. Simulations and analysis show that our approach can achieve low miss ratio and high CPU utilization.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"40 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":"124932241","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
Energy - responsiveness tradeoffs for real-time systems with mixed workload 具有混合工作负载的实时系统的能量响应权衡
Hakan Aydin, Qi Yang
{"title":"Energy - responsiveness tradeoffs for real-time systems with mixed workload","authors":"Hakan Aydin, Qi Yang","doi":"10.1109/RTTAS.2004.1317251","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317251","url":null,"abstract":"We explore the performance tradeoffs for real-time systems with dynamic voltage scaling (DVS) capability, when the workload includes aperiodic jobs as well as periodic tasks. As opposed to the assumptions of early works on real-tune DVS or nonpower-aware scheduling of hybrid task sets, the settings require the consideration of two often-conflicting objectives: Improving the responsiveness of aperiodic jobs and reducing the energy consumption. We propose the composite metric, energy * average response time, as a performance measure in energy-aware scheduling of hybrid task sets. Then we develop our framework that integrates dynamic reclaiming algorithm (DRA) and total bandwidth server (TBS) mechanism in variable-speed settings. In addition to the static algorithm, we propose basic reclaiming scheme (BRS) and mutual reclaiming scheme (MRS) that enable the reuse of the system slack arising from early task completions. We also present our bandwidth sharing scheme (BSS) that aggressively exploits the bandwidth reserved for TBS to further slow down the periodic tasks. We provide an experimental evaluation of our algorithms under different workloads and speed settings, and show that BSS can provide significant performance improvements when the actual variability in the workload is high.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"411 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":"133569645","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}
引用次数: 25
HARMONICA: enhanced QoS support with admission control for IEEE 802.11 contention-based access HARMONICA:增强的QoS支持,为IEEE 802.11基于争用的访问提供准入控制
Liqiang Zhang, S. Zeadally
{"title":"HARMONICA: enhanced QoS support with admission control for IEEE 802.11 contention-based access","authors":"Liqiang Zhang, S. Zeadally","doi":"10.1109/RTTAS.2004.1317250","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317250","url":null,"abstract":"Currently deployed IEEE 802.11 WLANs work mostly with distributed coordination function (DCF) mode at the MAC layer, which does not provide QoS support. The upcoming IEEE standard 802.11e achieves service differentiation by assigning different channel access parameters (CAPs) to different traffic classes at the MAC layer. However, such relative differentiation does not yield QoS guarantee. In practice, appropriately selecting CAPs a priori is difficult. Time-varying traffic loads also make the use of fixed CAPs inefficient for both QoS support and channel utilization. We propose a novel architecture called HARMONICA, in which the access point dynamically selects the best CAPs for each traffic class to optimally match their QoS requirements. We present and discuss a simple admission control mechanism used by HARMONICA to avoid congestion. Our simulation results demonstrate that under an interference-free environment, HARMONICA can guarantee the QoS for all traffic classes while simultaneously achieving quasi-optimal channel utilization.","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":"115071353","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}
引用次数: 58
A real-time model for the robotic highway safety marker system 机器人公路安全标志系统的实时模型
Jiazheng Shi, S. Goddard, Anagh Lal, S. Farritor
{"title":"A real-time model for the robotic highway safety marker system","authors":"Jiazheng Shi, S. Goddard, Anagh Lal, S. Farritor","doi":"10.1109/RTTAS.2004.1317279","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317279","url":null,"abstract":"We present the design and implementation of a real-time model for the global control of robotic highway safety markers. Problems addressed in the system are: 1) poor scalability and predictability as the number of markers increases, 2) jerky movement of markers, and 3) false-hits caused by environment objects. We extensively analyze the system and offer two solutions: a basic solution and an enhanced solution. They are built respectively upon two task models: the periodic task model and the variable rate execution task model. The former is characterized by four static parameters: phase, period, worst case execution time and relative deadline. The latter has similar parameters. Its parameter values, however, are allowed to change at arbitrary times. We then examine two typical real-time scheduling approaches: rate monotonic (RM) priority driven and earliest deadline first (EDF). Analysis of their sufficient conditions shows that our system is feasibly schedulable under either RM or EDF. This conclusion justifies that the path for each safety marker can be guaranteed to be smooth under the designed real-time system. For the scalability issue, we present a sufficient condition for the upper bound on the number of barrel robots that can be reliably controlled. One key technique integrated into our real-time system is the Hough transform. We refine its traditional implementation so that, for the task of detecting safety markers, the time complexity decreases and the reliability increases with only slight additional storage for search windows. The basic idea behind our improvements is to limit the search window for safety markers.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"38 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":"115668988","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}
引用次数: 13
Efficient response-time analysis for tasks with offsets 对具有偏移的任务进行有效的响应时间分析
Jukka Mäki-Turja, Mikael Nolin
{"title":"Efficient response-time analysis for tasks with offsets","authors":"Jukka Mäki-Turja, Mikael Nolin","doi":"10.1109/RTTAS.2004.1317293","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317293","url":null,"abstract":"We present a method that enables an efficient implementation of the approximative response-time analysis (RTA) for tasks with offsets presented by Tindell [(1992)] and Palencia Gutierrez et al. [(1998)]. The method allows for significantly faster implementations of schedulability tools using RTA. Furthermore, reducing computation time, from tens of milliseconds to just a fraction of a millisecond, as we show, is a step towards online RTA in for example admission control systems. We formally prove that our reformulation of earlier presented equations is correct and allow us to statically represent parts of the equation, reducing the calculations during fix-point iteration. We show by simulations that the speedup when using our method is substantial. When task sets grow beyond a trivial number of tasks and/or transactions a speed-up of more than 100 times (10 transactions and 10 tasks/transaction) compared to the original analysis can be obtained.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"47 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":"123689165","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}
引用次数: 21
Design trade-offs for networks with soft end-to-end timing constraints 为具有软端到端时序约束的网络设计权衡
Haifeng Zhu, J. Lehoczky, Jeffery P. Hansen, R. Rajkumar
{"title":"Design trade-offs for networks with soft end-to-end timing constraints","authors":"Haifeng Zhu, J. Lehoczky, Jeffery P. Hansen, R. Rajkumar","doi":"10.1109/RTTAS.2004.1317288","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317288","url":null,"abstract":"As broadband capabilities on wired, wireless and mobile phone networks proliferate, real-time multimedia traffic is expected to consume higher portions of the available bandwidth. Usage models in such networks range from low-cost VoIP to high-cost, high-quality, high-resolution video streams along with many intermediate data streams. Video flows, however, have stochastic processing requirements, and they may result in very low utilization levels if traditional real-time scheduling techniques are used. This calls for new analytical methods. In this paper, we illustrate a set of new techniques for reasoning about the lateness of such stochastic flows, and apply it to engineer a wired multihop real-time network. We make use of 4 dominant parameters to characterize the design space: end-to-end deadline, acceptable lateness, the number of hops and the network workload. Given any three of these parameters, the remaining parameter can be computed. For instance, if a stochastic flow passes through 10 nodes, its end-to-end deadline is 150 ms, and no more than 0.1% of the packets can be late, what is the maximum allowable system workload that would satisfy the lateness requirements? This maximum allowable workload can then be used to develop for the admission control policy to guarantee that the specified timeliness requirements are met. This paper provides insights into real-time network effects and rules of thumb to properly engineer a high utilization real-time EDF (earliest deadline first) network. Simulation and experimental results validate our methods. Our techniques are further applicable to heterogeneous network cases where some nodes on the flow path are bottlenecks or have cross traffic from other flows.","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":"129396542","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}
引用次数: 3
Online control for self-management in computing systems 计算机系统中自我管理的在线控制
S. Abdelwahed, Nagarajan Kandasamy, S. Neema
{"title":"Online control for self-management in computing systems","authors":"S. Abdelwahed, Nagarajan Kandasamy, S. Neema","doi":"10.1109/RTTAS.2004.1317283","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317283","url":null,"abstract":"Dependable computer systems hosting critical commerce, transportation, and military applications, among others, must satisfy stringent quality-of-service (QoS) requirements. However, as these systems become increasingly complex, maintaining the desired QoS by manually tuning the numerous performance-related parameters are very difficult. This paper develops a generic online control framework to design self-managing computer systems. The proposed approach explores a limited region of the system state-space at each time step and decides the best control action accordingly. We present two case studies to demonstrate the practicality of the proposed control framework.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"56 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":"126212013","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}
引用次数: 77
Energy-aware traffic shaping for wireless real-time applications 无线实时应用的能量感知流量整形
C. Poellabauer, K. Schwan
{"title":"Energy-aware traffic shaping for wireless real-time applications","authors":"C. Poellabauer, K. Schwan","doi":"10.1109/RTTAS.2004.1317248","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317248","url":null,"abstract":"Sleep modes of wireless network cards are used to switch these cards into low-power state when idle, but large timeout periods and frequent wake-ups can reduce the utility of this approach. Modern processors offer the ability to switch CPU voltages or clock frequencies and therefore reduce CPU energy consumption, however, that can reduce the sleep durations of a network device, adversely affecting the achievable energy savings. This paper describes an approach in which multiple resource managers cooperate to reduce a mobile device's energy consumption. This system-level approach is based on the integrated management of a real-time CPU scheduler, the frequency scaling capabilities of a modern processor, a QoS packet scheduler, and the low-power sleep mode of a wireless network card.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"96 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":"123083772","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}
引用次数: 62
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学术官方微信
小红书