{"title":"Optimization of soft real-time systems with deadline miss ratio constraints","authors":"Sorin Manolache, P. Eles, Zebo Peng","doi":"10.1109/RTTAS.2004.1317304","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317304","url":null,"abstract":"Both analysis and design optimization of real-time systems has predominantly concentrated on considering hard real-time constraints. For a large class of applications, however, this is both unrealistic and leads to unnecessarily expensive implementations. We address the problem of task priority assignment and task mapping in the context of multiprocessor applications with stochastic execution times and in the presence of constraints on the percentage of missed deadlines. We propose a design space exploration strategy based on tabu search together with a fast method for system performance analysis. Experiments emphasize the efficiency of the proposed analysis method and optimization heuristic in generating high quality implementations of soft real-time systems with stochastic task execution times and constraints on deadline miss ratios.","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":"129122269","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}
L. Marzario, G. Lipari, Patricia Balbastre Betoret, A. Crespo
{"title":"IRIS: a new reclaiming algorithm for server-based real-time systems","authors":"L. Marzario, G. Lipari, Patricia Balbastre Betoret, A. Crespo","doi":"10.1109/RTTAS.2004.1317266","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317266","url":null,"abstract":"In this paper we present a new algorithm for CPU resource reservation in real-time systems that allows the coexistence of hard, soft and non real-time tasks. The proposed algorithm is specifically designed to handle computational overload. A task that needs more CPU-time than reserved can reuse the spare bandwidth, without interfering with the others tasks. With respect to other reclamation schemes, the novelty of the proposed algorithm is that the spare bandwidth is fairly distributed among the needing servers. The effectiveness of the algorithm is demonstrated with an extensive set of experiments. We also propose a methodology to set scheduling parameters depending on the type of the task and on the time constraints needed.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"39 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":"125895826","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}
{"title":"Enhancing the AvrX kernel with efficient secure communication using software thread integration","authors":"P. Ganesan, A. Dean","doi":"10.1109/RTTAS.2004.1317272","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317272","url":null,"abstract":"We present methods to add efficient cryptographic support to low-performance embedded processors with embedded networks (e.g. sensor networks). Software thread integration (STI) is used to create efficient threads which can perform cryptographic operations during time-slice (TDMA) communication, eliminating most context-switching overhead. The AvrX kernel is enhanced to automatically select the most efficient threads based upon available work, saving processor cycles and power. The results show that an STI-based implementation enables communication at higher rates while also performing more cryptographic work compared with traditional ISR (interrupt service routine) or busy-wait schemes. Significant performance improvements are found for both the RC4 and RC5 ciphers. First, STI enables cryptographic processing to occur during communication at a bit rate of f/sub cpu//8, which is not possible with an ISR approach. Second, cryptographic throughput at lower communication rates increases by up to 200% for both RC4 and RC5.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"6 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":"128865660","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}
{"title":"Supporting dynamic QoS in Linux","authors":"Xin Liu, S. Goddard","doi":"10.1109/RTTAS.2004.1317270","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317270","url":null,"abstract":"This work is an application of the variable-rate execution (VRE) model in Linux to support dynamic quality of service (QoS). Based on conventional time-sharing scheduling algorithms, Linux does not adequately support QoS requirements. The VRE scheduler can assign a specified execution rate to any application, and dynamically adjust the execution rate during runtime. Rate controller components are introduced to adjust a task's execution rate based on predefined rules and runtime feedbacks, such as the suspension time, the queue length, and so on. A significant feature of this work is its ability to support legacy applications at the binary level. On conventional operating systems, millions of applications have been built under time-sharing schedulers, which we call legacy applications. Under the VRE model, a legacy application can obtain a guaranteed variable execution rate. We also designed a simple default rate controller for legacy multimedia applications. The Linux kernel was slightly modified in our implementation to achieve reconfigurability. Both the VRE scheduler and the default rate controller are implemented as Linux loadable modules, which can be dynamically loaded into the kernel to replace the Linux scheduler or change the behavior of the scheduler. We provide a set of interfaces for users to design and use their own schedulers and rate controllers.","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":"129673063","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}
{"title":"Task partitioning upon heterogeneous multiprocessor platforms","authors":"Sanjoy Baruah","doi":"10.1109/RTTAS.2004.1317301","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317301","url":null,"abstract":"Given a collection of recurring tasks or processes that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is shown that this problem is intractable (NP-hard in the strong sense). Efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented, and proved correct.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"7 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":"130936835","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}
V. Vishnumurthy, T. Sandeep, B. S. Manoj, C. Murthy
{"title":"A novel out-of-band signaling mechanism for enhanced real-time support in tactical ad hoc wireless networks","authors":"V. Vishnumurthy, T. Sandeep, B. S. Manoj, C. Murthy","doi":"10.1109/RTTAS.2004.1317249","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317249","url":null,"abstract":"Ad hoc wireless networks have been an increasingly important area of research in the recent past. One issue of great interest in this area is the provision of real-time support. While existing military applications use reservation-based approaches to provide real-time bandwidth guarantees, these schemes are adversely affected by node mobility. We propose an enhanced real-time support scheme that uses a novel out-of-band signaling mechanism to predict future mobility patterns and take corrective action when needed. We also propose an architecture to support differentiated service classes. This helps mobility affected nodes to take proactive measures so as to offer better real-time services to bandwidth critical applications. Through extensive simulations, we show that the use of the out-of-band signaling leads to better real-time support overall, and better response to the more critical classes as needed. We also provide a theoretical analysis for estimating the probability of disruption of a real-time call.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"211 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":"131009247","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}
{"title":"On the fundamental capacity and lifetime limits of energy-constrained wireless sensor networks","authors":"Zhihua Hu, Baochun Li","doi":"10.1109/RTTAS.2004.1317243","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317243","url":null,"abstract":"Energy constraints on sensor nodes pose significant challenges towards extending operational lifetimes and sustainable capacities of wireless sensor networks. We seek to answer two fundamental questions with respect to energy-constrained sensor networks. First, what is the operational lifetime of a particular wireless sensor network under the control of optimal power management schemes? With an adequate definition of operational lifetimes, our asymptotic analysis shows that, with fixed node densities, operational lifetime of sensor networks decreases in the order of 1/n as the number of initially deployed nodes n grows. Second, what is the impact of constrained energy levels on the maximum sustainable throughput in sensor networks? Even with renewable energy sources on each of the sensors (e.g., solar energy sources), our analysis concludes that the maximum sustainable throughput in energy-constrained sensor networks scales worse than the capacity based on interference among concurrent transmissions as long as the physical network size grows with n in the order greater than log n. In this case, when the number of nodes is sufficiently high, the energy-constrained network capacity dominates.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"3 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":"131086644","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}
A. Uvarov, L. DiPippo, V. Wolfe, Kevin Bryan, Patrick Gadrow, Timothy Henry, Matthew Murphy, P. Work, Louis P. DiPalma
{"title":"Static real-time data distribution","authors":"A. Uvarov, L. DiPippo, V. Wolfe, Kevin Bryan, Patrick Gadrow, Timothy Henry, Matthew Murphy, P. Work, Louis P. DiPalma","doi":"10.1109/RTTAS.2004.1317297","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317297","url":null,"abstract":"We describe the design and implementation of a static real-time data distribution mechanism that uses a real-time event service and a real-time scheduling service to ensure the ontime, and temporally valid delivery of data. The mechanism implements an algorithm, called the just-in-time data distribution algorithm to determine scheduling parameters that will ensure that data that arrives at a requesting target is valid. We use a navy weapons alignment application to demonstrate the necessity and usefulness of the algorithm and implementation. We also present results of tests that demonstrate that our implementation fulfills the guarantees predicted by the theoretical results.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"61 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":"129422081","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}
{"title":"Design of digital control systems with dynamic voltage scaling","authors":"H. Lee, Byung Kook Kim","doi":"10.1109/RTTAS.2004.1317253","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317253","url":null,"abstract":"For real-time computer-controlled systems, control performances of tasks as well as energy consumption of overall system must be optimized. A control task does not have a fixed period but a range of periods in which control performance varies. Hence when more than one control tasks are scheduled on a single processor, an optimization problem appears. Furthermore, when an energy saving technique such as dynamic voltage scaling is used, its properties affect the control performance. Using a performance index that involves control performance and energy consumption, a static solution is proposed to obtain optimal processor speed and a set of periods for given control tasks in O(k). Also, a dynamic solution is proposed to utilize system services of real-time operating systems to overcome unavoidable deficiencies of the static solution and to further reduce the energy consumption of the overall system. The performances of proposed solutions are revealed via simulation studies.","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":"129567994","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}
{"title":"Loss-tolerant QoS using firm constraints in guaranteed rate networks","authors":"A. Koubâa, Yeqiong Song","doi":"10.1109/RTTAS.2004.1317300","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317300","url":null,"abstract":"We propose a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of (m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using network calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"27 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":"121971680","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}