{"title":"An object oriented model for parallel and reactive systems","authors":"A. Attoui, Michel Schneider","doi":"10.1109/REAL.1991.160361","DOIUrl":"https://doi.org/10.1109/REAL.1991.160361","url":null,"abstract":"MO2 is an object-oriented model which integrates features of database management systems (DBMSs) and features of real-time systems. It allows for the definition of different kinds of relationships between objects: generalization/specialization, aggregation, and association. Its principal feature is the ability to distinguish passive objects and active objects. The passive objects react only through the activation of their methods. The active objects can have their own behavior and can evolve under the solicitation of various events independently of the activation of their methods. Various timing constraints can be specified on methods or method blocks. MO2 is able to model software objects as well as hardware objects. This model is suited for implementation in distributed environments and multiprocessor systems.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123073295","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 features for Ada 9X","authors":"T. Baker, O. Pazy","doi":"10.1109/REAL.1991.160371","DOIUrl":"https://doi.org/10.1109/REAL.1991.160371","url":null,"abstract":"Ada 9X is a revision of the Ada programming language standard. This revision includes some changes that are intended to improve Ada's usefulness for real-time applications. The changes under consideration include multiple clocks, new forms of delay statements, a new low-level data synchronization scheme based on a limited form of priority inheritance, and a mechanism for asynchronously controlling the execution of a task. These proposals deserve critical evaluation and refinement before they become part of a new standard. The authors deal with time measurement and with a mechanism for synchronizing shared data. They address changes to the Ada priority scheduling model and discuss a mechanism for improving responsiveness to asynchronous events.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"44 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120973762","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 real-time DBMS performance with multiversion data and priority based disk scheduling","authors":"W. Kim, J. Srivastava","doi":"10.1109/REAL.1991.160377","DOIUrl":"https://doi.org/10.1109/REAL.1991.160377","url":null,"abstract":"Real-time multiversion concurrency control algorithms are proposed, to: increase concurrency, adjust the serialization order dynamically and work without an estimate of a transaction's runtime. The authors also propose disk scheduling algorithms which consider not only the transactions which request input/output (I/O) but also those affected by I/O. They consider transactions which are directly affected when priorities of I/O requests are assigned, in addition to transactions which generates these requests. The real-time disk resident database system model and the multiversion concurrency control algorithms are described. The real-time disk scheduling algorithms and their properties are also described. Real-time multiversion concurrency control and disk scheduling algorithms are shown to decrease miss ratio significantly.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126904669","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 priority ceiling protocol for multiple-instance resources","authors":"Min-Ih Chen, Kwei-Jay Lin","doi":"10.1109/REAL.1991.160367","DOIUrl":"https://doi.org/10.1109/REAL.1991.160367","url":null,"abstract":"A systematic optimization process for multiple-instance resource sharing in real-time systems is presented. The authors derive the schedulability condition for systems with such resources and present an algorithm which can be used to divide a resource pool into smaller groups in order to improve the worst-case blocking behavior. They present the system model used and review some related work. The multi-instance priority ceiling protocol and its properties are discussed, the effect of resource preallocation on the schedulability of a system is studied, and an optimal resource preallocation algorithm is presented.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558964","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":"Load adjustment in adaptive real-time systems","authors":"Tei-Wei Kuo, A. Mok","doi":"10.1109/REAL.1991.160369","DOIUrl":"https://doi.org/10.1109/REAL.1991.160369","url":null,"abstract":"A framework is given for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time. The schedulability of adjustable periodic processes by a preemptive fixed priority scheduler is formulated in terms of a configuration selection problem. Specifically, two process transformations are introduced for the purpose of deriving a bound for the achievable utilization factor of processes whose periods are related by harmonics. This result is then generalized so that the bound is applicable to any process set and an efficient algorithm to calculate the bound is provided. When the list of allowable configurations is implicitly given by a set of scalable periodic processes, the corresponding period assignment problem is shown to be NP-complete. The authors present an approximation algorithm for the period assignment problem for which some encouraging experimental results are included.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132951706","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 diffusion model based task remapping for distributed real-time systems","authors":"Morikazu Takegaki, H. Kanamaru, Masaya Fujita","doi":"10.1109/REAL.1991.160352","DOIUrl":"https://doi.org/10.1109/REAL.1991.160352","url":null,"abstract":"A fault-tolerant architecture for loosely coupled distributed real-time systems is considered and a distributed task management method that aims at network-wide fault tolerance, compatible with flexible resource utilization is proposed. The task management method includes a checkpoint data transfer mechanism and an adaptive task remapping mechanism. A policy of task remapping is based on the thermodynamic diffusion model, in which tasks are diffused among sound nodes and global balance is achieved by several repetitions of local load sharing. Convergence to this steady state is theoretically ensured. The protocol of the proposed task remapping algorithm, the two-phase diffusion algorithm, is completely distributed and weakly synchronized; each node starts the same algorithm periodically, without waiting for any messages, but waits for messages from neighboring nodes during execution of the algorithm.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381899","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 non-preemptive scheduling of period and sporadic tasks","authors":"K. Jeffay, D. Stanat, C. Martel","doi":"10.1109/REAL.1991.160366","DOIUrl":"https://doi.org/10.1109/REAL.1991.160366","url":null,"abstract":"A fundamental problem in the theory of real-time scheduling is examined: scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. The authors give a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. They show that any set of periodic or sporadic tasks that satisfies C can be scheduled with an earliest-deadline-first (EDF) scheduling algorithm. The authors present the scheduling model, briefly review the literature in real-time scheduling, prove that the non-preemptive EDF algorithm is universal for sets of tasks, whether periodic or sporadic, and demonstrate the absence of a universal algorithm for periodic tasks with specified release times. It is proved that the problem of deciding schedulability of a set of concrete periodic tasks is intractable.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131239865","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 requirements specification method for adaptive real-time systems","authors":"A. Muntz, R. W. Lichota","doi":"10.1109/REAL.1991.160382","DOIUrl":"https://doi.org/10.1109/REAL.1991.160382","url":null,"abstract":"A method for facilitating the specification and analysis of semihard real-time systems is described. The authors introduce the notion of an activity, the fundamental unit of computation upon which the methodology is based. They present a notation for creating an integrated requirements model which addresses the functional, behavioral, temporal, and information aspects of a semihard real-time system. It is shown how the fundamental properties of a requirements model can be analyzed. Extensions of the activity formalism to other classes of semihard real-time systems are considered. The authors show that this approach can be used to specify adaptive as well as periodic and sporadic computations.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602762","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 transient server approach to scheduling time-critical recovery operations","authors":"S. R. Thuel, J. Strosnider","doi":"10.1109/REAL.1991.160385","DOIUrl":"https://doi.org/10.1109/REAL.1991.160385","url":null,"abstract":"A scheduling approach is given for servicing the nondeterministic workload demands of time-critical recovery operations triggered by the detection of errors in periodic real-time workloads. This approach, referred to as the transient server, has been developed within the context of fixed-priority preemptive systems. For these systems, it is proved that deadline monotonic scheduling is optimal in maximizing the service opportunities for recovery requests. A scheduling-theoretic framework for integrating time-invariant deadline- and criticalness-based priorities is developed, motivated by the need to guarantee that the real-time workload experiences a graceful degradation during recovery.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131125764","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":"Clairvoyance, capricious timing faults, causality, and real-time specifications","authors":"D. Stuart, P. Clements","doi":"10.1109/REAL.1991.160381","DOIUrl":"https://doi.org/10.1109/REAL.1991.160381","url":null,"abstract":"The authors examine the issues of satisfiability, clairvoyance, the demonstrable existence of timing faults, and event causality, all in the context of formal methods for real-time systems. Representative languages and logics are introduced to illustrate the points. The authors introduce SRSL, a simplified specification language used to illustrate the issues involved. They examine these issues in a particular specification language, Modechart. An action-free subset of Modechart is shown to be satisfiable and to obviate the need for clairvoyance. A technique for eliminating nonlinearizable computations from a specification language is shown. The usefulness of the ideas is illustrated by their use in a Modechart simulator.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124093222","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}