{"title":"Efficient scheduling of real-time multi-task applications in dynamic systems","authors":"G. Lipari, Sanjoy Baruah","doi":"10.1109/RTTAS.2000.852461","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852461","url":null,"abstract":"The Bandwidth Sharing Server (BSS) is a scheduling strategy for multi-task real time applications that provides the dual properties of performance guarantees and inter-application isolation. We describe the BSS-I algorithm, an evolution of the BSS, aimed at: (i) improving the run-time performance and (ii) generalizing the kinds of performance guarantees that can be offered.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129949548","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":"Dynamic optimization for real-time rule-based systems using predicate dependency","authors":"Yun-Hong Lee, A. Cheng","doi":"10.1109/RTTAS.2000.852459","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852459","url":null,"abstract":"A new run-time dynamic optimization to reduce the upper bound of real time rule based expert systems is presented. It constructs a predicate dependency list which consists of a predicate, active rule set, and inactive rule set, for each predicate in a real time rule based program. It then generates an inactive rule set by combining all false rules in a predicate dependency list together, and dynamically selects rules to be evaluated at run-time based on the inactive rule set. For the timing analysis of the proposed algorithm, we introduce a predicate based rule dependency graph and its construction algorithm. We also discuss the bounded time of the EQL rule based program using the predicate based rule dependency graph. The performance evaluation shows that the dynamic optimizer reduces the number of rule evaluations and the number of predicate evaluations as well as the response time upper bound significantly, and also the new algorithm has better upper bound comparing to the other optimization methods.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134155718","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":"Efficient on-line schedulability tests for priority driven real-time systems","authors":"Tei-Wei Kuo, Yu-Hua Liu, Kwei-Jay Lin","doi":"10.1109/RTTAS.2000.852446","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852446","url":null,"abstract":"Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial-time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. This paper presents efficient online schedulability tests which are are shown to be more precise and efficient than any existing polynominal-time schedulability tests. Moreover, our proposed tests can be used for the multiframe model, where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126236964","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":"Chocolate: a reservation-based real-time Java environment on Windows/NT","authors":"Dionisio de Niz, R. Rajkumar","doi":"10.1109/RTTAS.2000.852471","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852471","url":null,"abstract":"The authors present Chocolate, a reservation based real time Java run-time environment that runs on Windows NT. We first present a brief overview of the emerging real time Java standard and the Resource Kernel (RK) approach to providing timely, guaranteed and enforced access to system resources. Chocolate is a real time Java Virtual Machine that interfaces the real time Java programming language with the abstractions of a resource kernel. It also supports memory regimes to control allocation time and a protocol to bound priority inversion. This version of Chocolate is implemented on top of NT/RK, an OS environment that includes a \"portable resource kernel\" within the NT kernel. Our detailed evaluation of Chocolate shows that the overhead introduced by NT/RK is acceptable. A real time Java audio package on Chocolate demonstrates significantly better performance than its non real time counterpart. However, our Hartstone benchmark evaluations also show that our NT/RK implementation does have its drawbacks due to the lack of hard real time capabilities within Windows NT.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786304","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":"Formal verification of the MetaH executive using linear hybrid automata","authors":"S. Vestal","doi":"10.1109/RTTAS.2000.852458","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852458","url":null,"abstract":"MetaH is a language and toolset for the development of real time high assurance software. There is an associated executive that is automatically configured by the tools to perform the task and message scheduling specified for an application. Linear hybrid automata are finite state automata augmented with real-valued variables. Transitions between discrete states may be conditional on the values of these variables and may reassign variables. These variables can be used to model real time and accumulated task compute time as well as program variables. We developed a concurrent linear hybrid automata model for that portion of the MetaH executive software that implements task scheduling and time partitioning. A reachability analysis was performed to verify selected properties for a selected set of application configurations. The approach combines aspects of testing and verification and automates much of the modeling and analysis. There are limits on the degree of assurance that can be provided, but the approach may be more thorough and less expensive than some traditional testing methods.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116472066","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":"SomeCast. A paradigm for real-time adaptive reliable multicast","authors":"Jaehee Yoon, Azer Bestavros, I. Matta","doi":"10.1109/RTTAS.2000.852455","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852455","url":null,"abstract":"SomeCast is a novel paradigm for the reliable multicast of real time data to a large set of receivers. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics of paths between senders and receivers, and the dynamic conditions of such paths. SomeCast enables receivers to dynamically adjust the rate at which they receive multicast information to enable the satisfaction of their QoS constraints. This is done by enabling a receiver to join SOME number of concurrent multiCAST sessions, whereby each session delivers a portion of an encoding of the real time data. By adjusting the number of such sessions dynamically, client-specific QoS constraints are met independently. The SomeCast paradigm can be thought of as a generalization of the AnyCast and ManyCast paradigms, which have been proposed in the literature to address issues of scalability of UniCast and MultiCast environments, respectively. The authors overview the SomeCast paradigm, describe an instance of a SomeCast protocol, and present simulation results that quantify the significant advantages gained from adopting such a protocol.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990455","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}
Kimoon Kim, Gwangil Jeon, Seongsoo Hong, Tae-hyung Kim, Sunil Kim
{"title":"Integrating subscription-based and connection-oriented communications into the embedded CORBA for the CAN bus","authors":"Kimoon Kim, Gwangil Jeon, Seongsoo Hong, Tae-hyung Kim, Sunil Kim","doi":"10.1109/RTTAS.2000.852462","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852462","url":null,"abstract":"The authors present the design of CAN-CORBA, an environment-specific CORBA for CAN-based distributed control systems. The ORB core of the CAN-CORBA has the following properties. (1) It supports subscription based group communication as well as the classical connection oriented point-to-point communication of CORBA; as a result, it better services the data multicasting requirement of typical control systems. (2) It significantly lowers the amount of message traffic required for each CORBA method invocation so that even the slow broadcast bus of the CAN can tolerate the overhead of CORBA method invocations. To seamlessly integrate two communication schemes into our extremely light-weight ORB, we design a transport layer protocol on the CAN that can support up to four different upper level protocols. We have implemented the CAN-CORBA on the mArx real time operating system developed at Seoul National University. Our experiments clearly demonstrate that it is feasible to use CORBA in developing distributed embedded control systems possessing severe resource limitations.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128158084","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 and implementation of a caching system for streaming media over the Internet","authors":"E. Bommaiah, Katherine Guo, M. Hofmann, S. Paul","doi":"10.1109/RTTAS.2000.852456","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852456","url":null,"abstract":"Congested networks and overloaded servers resulting from the ever growing number of Internet users contribute to the lack of good quality video streaming over the Internet. We propose a design and implementation of a caching system for streaming media, which utilizes its local memory and disk resources to reduce network and server load, while also improving the video and audio quality perceived by end users. In particular, request aggregation, prefix caching and rate control mechanisms are used in the system design. The effectiveness of the system is validated through performance results from prototype implementation. As expected, the caching system reduces network and server load and improves client start-up latency.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130302845","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":"An engineering approach to determining sampling rates for switches and sensors in real-time systems","authors":"M. Moy, D. Stewart","doi":"10.1109/RTTAS.2000.852449","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852449","url":null,"abstract":"An objective of our work is to find more systematic methods of designing and implementing real-time device drivers for embedded systems. As part of this objective, we answer the question \"what is the best sampling rate to use for reading data from sensors that provide continuous data?\" Our experiences in answering this question for digital switch and analog sensor inputs is described. We first present a model of a real-time device driver that enables the driver to execute as its own thread of control, independent of whatever control task is using the data. We then present an engineering approach towards determining a good sample rate for reading digital switches and analog sensors that provide continuous data. Rather than providing a single value for the sample rate, ranges that are based on application parameters are derived analytically. An application designer can use these equations to quickly determine the minimum and maximum sampling rates for their device driver task.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988494","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":"Voltage-clock-scaling adaptive scheduling techniques for low power in hard real-time systems","authors":"CM Krishna, YH Lee","doi":"10.1109/RTTAS.2000.852460","DOIUrl":"https://doi.org/10.1109/RTTAS.2000.852460","url":null,"abstract":"Many embedded systems operate under severe power and energy constraints. Voltage clock scaling is one mechanism by which energy consumption may be reduced; it is based on the fact that power consumption is a quadratic function of the voltage, while the speed is a linear function. The authors show how voltage scaling can be scheduled to reduce energy usage while still meeting real time deadlines.","PeriodicalId":333394,"journal":{"name":"Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127388254","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}