{"title":"A mixed locking/abort protocol for hard real-time systems","authors":"Lih-Chyun Shu, M. Young","doi":"10.1109/RTOSS.1994.292552","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292552","url":null,"abstract":"Serializability greatly simplifies reasoning about correctness in concurrent systems, including real-time systems. Our research addresses concurrency control protocols that accommodate analytic guarantees of schedulability, can be implemented with small bounded overheads and blocking, and ensure serializable execution of entire tasks including complete read/compute/write cycles (as opposed to serializable execution only of short embedded transactions without computation.) One such protocol which combines locking and abort is described. Among its interesting properties are that transactions scheduled by locking are never aborted, tasks are aborted only due to conflict with higher priority tasks, and the cost of abortion can be bounded for the purpose of schedulability analysis. The protocol is illustrated with an avionics example. The priority ceiling protocol can ensure schedulability of 8 tasks if serializability of only short sequences of data accesses is required, but cannot schedule even the first 2 tasks if serializability is required for whole tasks. Under reasonable assumptions our protocol achieves schedulability of the first 6 tasks while guaranteeing serializability of entire tasks.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584614","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":"Temporal protection in real-time operating systems","authors":"C. W. Mercer, R. Rajkumar, J. Zelenka","doi":"10.1109/RTOSS.1994.292556","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292556","url":null,"abstract":"Real-time systems manipulate data types with inherent timing constraints. Priority-based scheduling is a popular approach to build hard real-time systems, when the timing requirements, supported run-time configurations, and task sets are known a priori. Future real-time systems will need to support these hard real-time constraints but in addition (a) provide friendly user and programming interfaces with audio and video data types (b) be able to communicate with global networks and systems on demand, and (c) support critical command and control services despite potential risks introduced by such added flexibility and dynamics. We argue that temporal protection mechanisms can be as beneficial in these systems as virtual memory protection. The processor reservation mechanism that we have implemented in Real-Time Mach, for example, provides guaranteed timing behavior for critical activities.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872993","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":"Correlation analysis techniques for refining execution time estimates of real-time applications","authors":"Rajesh K. Gupta, P. Gopinath","doi":"10.1109/RTOSS.1994.292561","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292561","url":null,"abstract":"Scheduling techniques based upon worst case execution times, as are commonly used in real-time applications, often result in severe underutilization of the processor resources since most tasks finish in much less time than their anticipated worst-case execution times. We describe techniques for identifying correlation among the executions of various statements within a program. We demonstrate how this information can be used to refine the estimate of remaining worst case execution time of a real-time task as the execution of the task progresses. Refined estimates can be used at run-time to achieve better utilization, of the system and early failure detection and recovery.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"444 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115727977","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":"Experience with a prototype of the POSIX \"minimal realtime system profile\"","authors":"T. Baker, F. Mueller, V. Rustagi","doi":"10.1109/RTOSS.1994.292569","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292569","url":null,"abstract":"This paper describes experience in prototyping the proposed IEEE standard \"Minimal Realtime System Profile\", whose primary component is support for real-time threads. It provides some background, describes the implementation, and reports preliminary performance measurements.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126378659","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":"Predictable spin lock algorithms with preemption","authors":"H. Takada, K. Sakamura","doi":"10.1109/RTOSS.1994.292571","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292571","url":null,"abstract":"Both predictable interprocessor synchronization and fast interrupt response are required for real-time systems constructed using asymmetric shared-memory multiprocessors. This paper points out the problem that conventional spin lock algorithms cannot satisfy both requirements at the same time. To solve this problem, we have proposed an algorithm which is an extension of queueing spin locks modified to be preemptable for servicing interrupts. We propose an improved algorithm that minimizes the recovering overhead from an interrupt service. We also demonstrate that the proposed algorithms have required properties through performance measurement.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132597529","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}
Byung-Do Rhee, S. Min, Sung-Soo Lim, Heonshik Shin, Chong-Sang Kim, C. Park
{"title":"Issues of advanced architectural features in the design of a timing tool","authors":"Byung-Do Rhee, S. Min, Sung-Soo Lim, Heonshik Shin, Chong-Sang Kim, C. Park","doi":"10.1109/RTOSS.1994.292560","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292560","url":null,"abstract":"This paper describes a timing tool being developed by a real-time research group at Seoul National University. Our focus is on the issues resulting from advanced architectural features such as pipelined execution and cache memories found in many modern RISC-style processors. For each architectural feature we state the issues and explain our approach.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133691250","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":"Using data similarity to achieve synchronization for free","authors":"Tei-Wei Kuo, A. Mok","doi":"10.1109/RTOSS.1994.292550","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292550","url":null,"abstract":"M.H. Graham (1993) proposed several conditions which are sufficient to guarantee that a transaction system will run serializably without any extra effort having to be taken. Systems satisfying these conditions are said to achieve serializability for free. The conditions considered by Graham are determined by a syntactic check on the transaction programs, and are independent of the semantics of data. In this paper, we use a semantic approach and propose a sufficient condition for achieving data synchronization for free, which is based on the concept of data similarity. Real-time transactions satisfying this condition can be scheduled correctly by any process scheduling discipline that is designed for the independent processes model, e.g. RMS and EDF algorithms, where no locking of data is assumed. The correctness of our approach is justified by exploiting the idea of /spl Delta/-serializability.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372044","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":"Constructing a heterogeneous real-time system","authors":"S. Mostert","doi":"10.1109/RTOSS.1994.292565","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292565","url":null,"abstract":"The construction of a real-time system on heterogeneous hardware platforms, forces one to make choices on which programming language, operating system, development process and application programmers interface to use. The application (a micro-satellite) requirements state that the system must be dependable in a remote and harsh environment such as space. This paper details the choices made and the experience gained from living with the choices made in the development of a micro-satellite and its associated ground support. The emphasis is on simple solutions throughout. The simple solution is important for the verification and validation of the complete system.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296621","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":"Window-consistent replication for real-time applications","authors":"J. Rexford, A. Mehra, J. Dolter, F. Jahanian","doi":"10.1109/RTOSS.1994.292551","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292551","url":null,"abstract":"Two widely-studied approaches for structuring fault-tolerant services are the state-machine and the primary-backup replication schemes. For a large class of soft and hard real-time applications, the degree of consistency among servers can be exploited to design replication protocols with predictable timing behavior. This is particularly useful in applications such as automated process control, in which one can trade off the quality or precision for timely availability of data. This paper presents the architecture and prototype implementation of a primary-backup replication service that employs window consistency semantics between the primary data repository and the backups. A client registers a data object with the service by declaring the consistency requirements for the data, in terms of a time window. The primary ensures that each backup site maintains a version of the object that was valid on the primary within the preceding time window by scheduling update messages to the backups. Decoupling the transmission of updates to the backups from the processing of client requests permits the primary to handle a higher rate of operations and provide more timely service to clients. The non-blocking semantics free the client from waiting for updates to the backups to complete. Furthermore, real-time scheduling of update messages can guarantee controlled inconsistency between the primary and backup repositories.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125004546","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 platforms and environments for time constrained flexible manufacturing","authors":"J. Stankovic, K. Ramamritham, G. Zlokapa","doi":"10.1109/RTOSS.1994.292553","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292553","url":null,"abstract":"The Spring Kernel and associated algorithms, languages, and tools provide system support for static or dynamic real-time applications that require predictable operation. Spring currently consists of two major parts: (1) the development environment, where application and target systems are described, preprocessed and downloaded, and (2) the run-time environment, where the operating system, the Spring Kernel, creates and ensures predictable executions of application tasks. We have integrated our real-time systems technology with component technologies from robotics, computer vision, and real-time artificial intelligence, to develop a test platform for flexible manufacturing. The results being produced are generic so that they should be in many other real-time applications such as air traffic control and chemical plants. We describe this platform, identify new features developed, and comment on some lessons learned to date from this experiment.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477359","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}