{"title":"The cogency monitor: an external interface architecture for a distributed object-oriented real-time database system","authors":"J. Stankovic, S. Son, C. Nguyen","doi":"10.1109/RTTAS.1998.683189","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683189","url":null,"abstract":"The authors are developing a distributed database, called BeeHive, which could offer features along different types of requirements: real-time, fault-tolerance, security and quality-of-service for audio and video. Support of these features and potential trade-offs between them could provide a significant improvement in performance and functionality over current distributed database and object management systems. The BeeHive system however must be able to interact with existing databases and import such data. They present a high level design for this external interface and introduce the concept of a cogency monitor which acts as a gateway between BeeHive and the external world. The cogency monitor filters, shapes, and controls the flow of information to guarantee specified properties along the real-time, fault tolerance, quality of service, and security dimensions. They also describe three implementations of the cogency monitor and present some preliminary performance results that demonstrate the value of the cogency monitor.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117134901","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":"Time slot allocation for real-time messages with negotiable distance constraints","authors":"Libin Dong, R. Melhem, D. Mossé","doi":"10.1109/RTTAS.1998.683196","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683196","url":null,"abstract":"The authors present a time slot allocation scheme to support real-time communications with strict rate requirements and flexible distance constraints. They first devise an algorithm to schedule message streams on a single link. They then extend it to schedule real-time traffic on WDM optical star couplers, where the validation requirements of the device configuration are also taken into consideration in the scheduling algorithm. The results show that by decoupling the rate and distance constraint requirements of the real-time streams, high schedulability can be achieved with a small relative scheduling jitter.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127254784","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}
O. Sokolsky, M. Younis, Insup Lee, Hee-Hwan Kwak, Jeffrey X. Zhou
{"title":"Verification of the redundancy management system for space launch vehicle: a case study","authors":"O. Sokolsky, M. Younis, Insup Lee, Hee-Hwan Kwak, Jeffrey X. Zhou","doi":"10.1109/RTTAS.1998.683206","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683206","url":null,"abstract":"Formal methods have been widely recognized as effective techniques to uncover design errors that could be missed by a conventional software engineering process. The paper describes the authors' experience with using formal methods in analyzing the redundancy management system (RMS) for a space launch vehicle. RMS is developed by AlliedSignal Inc. for the avionics of NASA's new space shuttle, called VentureStar, that meets the expectations for space missions in the 21st century. A process algebraic formalism is used to construct a formal specification based on the actual RMS design specifications. Analysis is performed using PARAGON, a toolset for formal specification and verification of distributed real-time systems. A number of real-time and fault-tolerance properties were verified, allowing some errors in the RMS pseudocode to be detected. The paper discusses the translation of the RMS specification into process algebra formal notation and results of the formal verification.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281582","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}
B. Srinivasan, S. Pather, R. Hill, F. Ansari, D. Niehaus
{"title":"A firm real-time system implementation using commercial off-the-shelf hardware and free software","authors":"B. Srinivasan, S. Pather, R. Hill, F. Ansari, D. Niehaus","doi":"10.1109/RTTAS.1998.683194","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683194","url":null,"abstract":"The emergence of multimedia and high-speed networks has expanded the class of applications that combine the timing requirements of hard real-time applications with the need for operating system services typically available only on soft-real time or time-sharing systems. These applications, which the authors describe as firm real-time, currently have no widely-available, low-cost operating system to support them. They discuss modifications they have made to the popular Linux operating system that give it the ability to support the comparatively stringent timing requirements of these applications, while still giving them access to the full range of Linux services. Using their firm real-time system as a basis, they have developed the ATM Reference Traffic System (ARTS) that is capable of recording and accurately reproducing packet-level ATM traffic streams with timing resolution in microseconds. The effectiveness of this application, as well as the comparative ease with which it was developed illustrate the performance and utility of the system.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124384769","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":"Overload tolerance for single-processor workloads","authors":"Sanjoy Baruah","doi":"10.1109/RTTAS.1998.683182","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683182","url":null,"abstract":"In firm real time environments in which tasks must complete by their deadlines if they are to be of any value to the system, it is known that no uniprocessor online scheduling algorithm can guarantee to perform particularly well under conditions of overload as compared to clairvoyant algorithms. The article explores the issue of designing online scheduling algorithms that use multiple processors to compensate for their lack of clairvoyance. In particular, it is shown that given enough processors, online scheduling algorithms can be designed with performance guarantees arbitrarily close to that of optimal clairvoyant uniprocessor scheduling algorithms.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122590358","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":"Verification of the fast reservation protocol with delayed transmission using the tool KRONOS","authors":"S. Tripakis, S. Yovine","doi":"10.1109/RTTAS.1998.683200","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683200","url":null,"abstract":"The authors report the work carried out at VERIMAG within the framework of an research cooperation with CNET. The goal of the work was twofold: to formally specify the FRP-DT using the timed-automaton formalism, and to analyze its behavior using the tool KRONOS. The work has revealed some unexpected behaviors of the design such as a timeout that never expires, and transitions that never occur, and more important potential problems such as inconsistency in the bandwidth reserved along the connection path.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432649","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":"End-host architecture for QoS-adaptive communication","authors":"T. Abdelzaher, K. Shin","doi":"10.1109/RTTAS.1998.683195","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683195","url":null,"abstract":"Proliferation of communication-intensive real-time applications with \"elastic\" timeliness constraints such as streaming stored video, requires a new design for end-host communication subsystems. The design should (i) provide per-flow or per-service-class guarantees, (ii) maximize the aggregate utility of the communication service across all clients, (iii) gracefully adapt to transient overload, and (iv) avoid, if possible, starving lower-priority service classes during the period of sustained overload. The authors propose a QoS-optimization algorithm and communication subsystem architecture that satisfy the above requirements. It provides each client its contracted QoS, while adapting gracefully to transient overload and resource shortage. A new concept of flexible QoS contract is introduced, specifying multiple acceptable levels of service (or QoS levels for short) and their corresponding rewards for each client. Allowing clients to specify multiple QoS levels permits the server to perform QoS-optimization and degrade client's QoS under transient overload predictable, as specified in the QoS contract. Clients receive a money-back guarantee if the contracted QoS is violated by the server. The proposed resource-management mechanism maximizes server's total reward under resource constraints. They implemented and evaluated the architecture on a Pentium-based PC platform running under The Open Group (TOG) MK7.2 kernel, demonstrating the capability of the communication subsystem in meeting its design goals.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123578902","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":"bCANDLE: formal modelling and analysis of CAN control systems","authors":"D. Kendall, S. Bradley, W. Henderson, A. Robson","doi":"10.1109/RTTAS.1998.683201","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683201","url":null,"abstract":"Embedded control systems appear in many of the manufactured products upon which society increasingly depends. System developers need better development methods in order to be more confident that the systems which they deliver will behave properly. The need is particularly pressing in the case of distributed, hard real-time control systems for which testing is notoriously difficult. In recent years, much research has been conducted into formal techniques for analysing the quantitative temporal properties of system models. Such work offers the promise of complementing testing in the validation of systems by approaches which include simulation, symbolic monitoring, assertion checking and verification. The principal contribution of this paper is the introduction of a modelling language, bCANDLE, whose intended domain comprises embedded control systems in which computing nodes communicate using one or more controller area networks (CAN). bCANDLE is a simple but expressive language which includes value passing broadcast communication, message priorities and an explicit time construct. In giving a formal semantics to bCANDLE in terms of timed transition systems, the authors present for the first time an abstract, timed formal model of CAN.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128542094","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":"Real-time client-server push strategies: specification and evaluation","authors":"V. Kanitkar, A. Delis","doi":"10.1109/RTTAS.1998.683202","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683202","url":null,"abstract":"The widespread use of networked environments and the recent availability of high network bandwidths has rekindled interest in the area of automatic data refresh/update mechanisms. In many application areas, the updated information has a limited period of usefulness. Therefore, the development of systems and protocols that can handle such update tasks within predefined deadlines is required. The authors propose and evaluate two real-time update-propagation mechanisms in a client-server environment. The main idea is the transport of update transactions to the location of the cached data rather than the updated data itself. Unlike current push mechanisms, the propagation of update transactions to client sites is neither periodic nor mandatory. Instead, it is based on client-specific criteria which depend on the contents of the database object being updated. They examine real-time push scheduling issues using the popular client-server database model as the underlying framework and carry out a performance scalability study under varying system configurations.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126618936","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}
D. Schmidt, Sumedh Mungee, Sergio Flores-Gaitan, A. Gokhale
{"title":"Alleviating priority inversion and non-determinism in real-time CORBA ORB core architectures","authors":"D. Schmidt, Sumedh Mungee, Sergio Flores-Gaitan, A. Gokhale","doi":"10.1109/RTTAS.1998.683192","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683192","url":null,"abstract":"There is increasing demand to extend Object Request Broker (ORB) middleware to support distributed applications with stringent real-time requirements. However, conventional ORE implementations, such as CORBA ORBs, exhibit substantial priority inversion and non-determinism, which makes them unsuitable for applications with deterministic real-time requirements. The paper provides two contributions to the study and design of real-time ORB middleware. First, it illustrates empirically why conventional ORBs do not yet support real-time quality of service. Second, it evaluates connection and concurrency software architectures to identify strategies that reduce priority inversion and non-determinism in real-time CORBA ORBs.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198435","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}