{"title":"Efficient worst case timing analysis of data caching","authors":"Sung-Kwan Kim, S. Min, Rhan Ha","doi":"10.1109/RTTAS.1996.509540","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509540","url":null,"abstract":"Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching. However there has not been much progress in worst case timing analysis of data caching. This is mainly due to load/store instructions that reference multiple memory locations such as those used to implement array and pointer based references. These load/store instructions are called dynamic load/store instructions and most current analysis techniques take a very conservative approach to their timing analysis. In many cases, it is assumed that each of the references from a dynamic load/store instruction will miss in the cache and replace a cache block that would otherwise lead to a cache hit. This conservative approach results in severe overestimation of the worst case execution time (WCET). The paper proposes two techniques to minimize the WCET overestimation due to such load/store instructions. The first technique uses a global data flow analysis technique to reduce the number of load/store instructions that are misclassified as dynamic load/store instructions. The second technique utilizes data dependence analysis to minimize the adverse impact of dynamic load/store instructions. The paper also compares the WCET bounds of simple benchmark programs that are predicted with and without applying the proposed techniques. The results show that they significantly (up to 20%) improve the accuracy of WCET estimation especially for programs with a large number of references from dynamic load/store instructions.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116776769","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":"Putting fixed priority scheduling theory into engineering practice for safety critical applications","authors":"N. Audsley, I. Bate, A. Burns","doi":"10.1109/RTTAS.1996.509517","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509517","url":null,"abstract":"Describes the approach proposed by the York University Technology Centre for introducing fixed-priority scheduling into industrial safety-critical hard real-time systems. The work has been performed within the context of a class A (safety-critical) system as defined by civil aircraft software standard DO178B. Traditionally, class A systems have been scheduled by a cyclic executive. However, many such systems can be re-designed using a fixed-priority scheduler. This saves time and money, with no significant increase in risk. Also, significant technical benefits are apparent. This paper describes the timing requirements of the system, provides a potential scheduling approach (including appropriate timing analysis), and outlines an approach for gathering the necessary evidence for presentation to certification authorities.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876477","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":"The design of an open system with distributed real-time requirements","authors":"R. Ginis, V. Wolfe, J. Prichard","doi":"10.1109/RTTAS.1996.509525","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509525","url":null,"abstract":"This paper describes some of the US Navy's New Attack Submarine C3I system-an open system with distributed real-time requirements. It also presents our research design and prototyping efforts that address these requirements. It concludes by discussing several areas where further research is needed to allow open systems to better support real-time applications.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124177980","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":"Tutorial: real-time object-oriented modeling (ROOM)","authors":"B. Selić","doi":"10.1109/RTTAS.1996.509538","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509538","url":null,"abstract":"Developing real time software is particularly challenging since the complexity of the physical world has to be accommodated as well as stringent resource and timeliness constraints. Such circumstances require special language support over and above what can be found in general purpose programming languages. ROOM is both an object oriented modeling language and a development method specifically designed for dealing with large real time systems. It supports automatic code generation to ensure reliability and increase productivity.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127674988","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":"A framework for simulation of concurrency control policy in real-time systems","authors":"Chih Lai, H. R. Callison","doi":"10.1109/RTTAS.1996.509526","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509526","url":null,"abstract":"Control of concurrency is a critical aspect of both performance and correctness of real-time systems. Use of formal policies and mechanisms for concurrency control, in the style of transaction processing systems, would make it easier to reason about the logical correctness of concurrently executing processes in real-time systems. Adaptation of transaction processing techniques to real-time environments is a goal of our research. In this paper we describe a simulator used to study the interactions among scheduling policy, overload management, and concurrency control policy and the effects on the performance of real-time applications. The structure and capabilities of the simulator are described and its use in the evaluation of some concurrency control options for a real-time application is demonstrated. Through this example, we show how the simulation is customized for different processing models, scheduling options, and concurrency control policies.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125338093","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 predictability in real-time database systems","authors":"Young-Kuk Kim, S. Son","doi":"10.1109/RTTAS.1996.509521","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509521","url":null,"abstract":"Real-time database systems (RTDBSs) have timing constraints in their specifications, such as read times, deadlines and other temporal constraints. In addition, RTDBSs must adapt to changes in the operating environment and guarantee the completion of critical transactions. Previous research efforts in RTDBSs have been focused on scheduling transactions with soft or firm deadlines with serializability as the sole correctness criterion. Few results have been reported for supporting predictable transaction execution and guaranteeing the temporal consistency of data. The goal has been to minimize the deadline miss ratio and to maintain the logical consistency of data. In this paper, we address the issues of predictability and temporal consistency in RTDBSs. We briefly discuss the characteristics and requirements of RTDBSs, and present a transaction processing scheme that supports multiple levels of predictability for real-time transactions. The performance of the proposed scheme and the cost of achieving a high level of predictability is studied by using simulation.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125859180","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":"Designing for evolvability: building blocks for evolvable real-time systems","authors":"M. Gagliardi, R. Rajkumar, L. Sha","doi":"10.1109/RTTAS.1996.509527","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509527","url":null,"abstract":"Fielded real-time systems including many defense systems, manufacturing plants and commercial aircraft avionics typically have long lifetimes ranging from a few years to even a few decades. Available technologies, system needs and customer goals change over this lifetime, and changes to a deployed system become very desirable. We argue that such evolution must and can be supported with new system abstractions, and that real-time systems designed with these abstractions can be evolved and incrementally tested. We present two possible run-time abstractions which can act as basic building blocks to construct \"evolvable real-time systems\". These building blocks can be used to evolve deployed systems in general and real-time systems in particular. First, the replaceable unit abstraction alloys an existing software module to be replaced online by another module with similar or enhanced functionality. Such replacement is transparent to the rest of the system. Secondly, the \"cell\" abstraction represents a protected module which cannot be harmed by other modules. Based on this notion is an \"extensible cell\", which allows a deployed module to be extended functionally without the fear of hurting its (fully certified) functionality even when the extensions can fail in unexpected ways. These two abstractions have been implemented in a real-time POSIX testbed used in the Simplex architecture and our findings are reported. Both abstractions are built on the Real-Time Publisher/Subscriber communication model with modifications necessitated by safe evolutionary requirements. We conclude that guaranteed enforcement of the semantics of these two building blocks can only be provided using operating system enforced resource reservation and communication rights.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123107463","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":"Providing message delivery guarantees in pipelined flit-buffered multiprocessor networks","authors":"S. Balakrishnan, F. Özgüner","doi":"10.1109/RTTAS.1996.509529","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509529","url":null,"abstract":"Real-time applications when mapped to distributed memory multiprocessors produce periodic messages with an associated deadline and priority. Real-time extensions to wormhole routing (WR) with multiple virtual channels (VCs), suffer from unbounded priority inversion, rendering the global priority order ineffective. We propose a new flow control mechanism called Preemptive Pipelined Circuit Switching for Real-Time messages (PPCS-RT). To bound the priority inversion, we extend the model to PPCS-RTph, with preemption history stack for each VC. For the PPCS-RTph model, we describe a simple feasibility test and validate the test through flit level simulations. To improve the percentage of feasible messages, and average link utilization of the feasible message set, we also evaluate an enhanced PPCS-RTph model with additional architectural features.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126096069","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":"Building real-time music tools visually with Sonnet","authors":"D. Jameson","doi":"10.1109/RTTAS.1996.509518","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509518","url":null,"abstract":"We are building a variety of interactive music tools using Sonnet, a visual programming language in use at our center. Originally designed for sonification experiments for monitoring and debugging programs, Sonnet has grown into a more general system with a focus on real-time event-driven applications. In this paper, we describe some of the features of Sonnet followed by some examples of how it is being used.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"368 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277182","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":"Mechanical verification of timed automata: a case study","authors":"M. Archer, C. Heitmeyer","doi":"10.1109/RTTAS.1996.509536","DOIUrl":"https://doi.org/10.1109/RTTAS.1996.509536","url":null,"abstract":"The paper reports the results of a case study on the feasibility of developing and applying mechanical methods, based on the proof system PVS, to prove propositions about real time systems specified in the Lynch-Vaandrager timed automata model. In using automated provers to prove propositions about systems described by a specific mathematical model, both the proofs and the proof process can be simplified by exploiting the spectral properties of the mathematical model. The paper presents the PVS specification of three theories that underlie the timed automata model, a template for specifying timed automata models in PVS and an example of its instantiation, and both hand proofs and the corresponding PVS proofs of two propositions. It concludes with a discussion of our experience in applying PVS to specify and reason about real time systems modeled as timed automata.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114630615","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}