H. Tokuda, C. W. Mercer, Y. Ishikawa, T. E. Marchok
{"title":"Priority inversions in real-time communication","authors":"H. Tokuda, C. W. Mercer, Y. Ishikawa, T. E. Marchok","doi":"10.1109/REAL.1989.63587","DOIUrl":"https://doi.org/10.1109/REAL.1989.63587","url":null,"abstract":"The priority-inversion problems in real-time communication are addressed, and solutions developed for the ARTS distributed real-time operating system are presented. The performance results of the multi-thread-based protocol implementation are compared with those of other implementation schemes, and the schedulability is analyzed. Experimental results indicate that the multi-thread-based protocol implementation could eliminate potential priority-inversion problems and also demonstrate the same schedulability as the softint implementation scheme in spite of about 10% additional implementation overhead.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"71 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124808690","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 fault-tolerant microcomputer for advanced control: architecture and performability analysis","authors":"C. Constantinescu, C. Sandovici","doi":"10.1109/REAL.1989.63573","DOIUrl":"https://doi.org/10.1109/REAL.1989.63573","url":null,"abstract":"The hardware and software architecture of a fault-tolerant microcomputer for advanced control is presented. Use is made of performability as a performance and reliability measure. It is computed by means of the aggregation/decomposition technique with the aid of a numerical algorithm. An analysis is made of the influence of certain types of faults (i.e. permanent, intermittent, and transient) on the system performability. Different reward structures are compared and the effects of global and local repair actions are pointed out. An illustration is given of the influence of spare processing elements.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126040396","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":"Communicating shared resources: a model for distributed real-time systems","authors":"R. Gerber, Insup Lee","doi":"10.1109/real.1989.63558","DOIUrl":"https://doi.org/10.1109/real.1989.63558","url":null,"abstract":"A real-time formalism called communicating shared resources (CSR) is presented. CSR consists of a programming language that allows the explicit expression of timing constraints and resources, and a computation model that resolves resource contention based on event priority. A full denotational semantics is provided for the programming language, grounded in a resource-based computation model. To illustrate CSR, a distributed robot system consisting of a robot arm and a sensor is presented.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123852043","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 bounds for real-time process control in the presence of timing uncertainty","authors":"H. Attiya, N. Lynch","doi":"10.1109/REAL.1989.63580","DOIUrl":"https://doi.org/10.1109/REAL.1989.63580","url":null,"abstract":"A timing-based variant of the mutual-exclusion problem is considered. In this variant, only an upper bound on the time it takes to release the resource is known, and no explicit signal is sent when the resource is released; furthermore, the only mechanism to measure real time is an inaccurate clock, whose tick intervals take time between two constants. A new technique involving shifting and shrinking executions is combined with a careful analysis of the best allocation policy to prove a corresponding lower bound when control is distributed among processes connected by communication lines with an upper bound for message delivery time. These combinatorial results shed some light on modeling and verification issues related to real-time systems.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115733283","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 transformational method for verifying safety properties in real-time systems","authors":"M. Franklin, A. Gabrielian","doi":"10.1109/REAL.1989.63562","DOIUrl":"https://doi.org/10.1109/REAL.1989.63562","url":null,"abstract":"A two-step method is presented for verifying that safety properties are not violated by an HMS (hierarchical multistate) specification of a system. In the first step, the question of safety verification is recast as a reachability problem in an extension of the HMS machine. In the second step, reachability is determined by the use of correctness-preserving and partial correctness-preserving transformations. The method is shown to be complete, and it is illustrated by verifying that a safety property holds for a simple railroad-crossing system if all of its deadlines are met.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123560224","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 reasoning about time and reliability","authors":"H. Hansson, B. Jonsson","doi":"10.1109/REAL.1989.63561","DOIUrl":"https://doi.org/10.1109/REAL.1989.63561","url":null,"abstract":"A logic is presented for stating properties such as 'after a request for service there is at least a 98% probability that the service will be carried out within 2 s'. The logic extends the temporal logic CTL by E.A. Emerson et al. (1983) with time and probabilities. Formulas are interpreted over discrete time Markov chains. Algorithms are provided for checking that a given Markov chain satisfies a formula in the logic. An example is included to illustrate the algorithms.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126796","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 distributed fault tolerant architecture for nuclear reactor control and safety functions","authors":"M. Hecht, J. Agron, S. Hochhauser","doi":"10.1109/REAL.1989.63572","DOIUrl":"https://doi.org/10.1109/REAL.1989.63572","url":null,"abstract":"A fault-tolerant architecture that provides tolerance to a broad scope of hardware, software, and communications faults is being developed. This architecture relies on widely available commercial operating systems, local area networks, and software standards. Thus development time is significantly shortened, and modularity allows for continuous and inexpensive system enhancement throughout the expected 20-year life. The fault-containment and parallel-processing capabilities of computers are exploited to provide a high-performance, high-availability network capable of tolerating a broad scope of hardware, software, and operating system faults. The system can tolerate all but one known (and avoidable) single fault, two known and avoidable dual faults, and it will detect all higher-order fault sequences and provide diagnostics to allow for rapid manual recovery.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117169854","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 decomposition approach to non-preemptive scheduling in hard real-time systems","authors":"X. Yuan, A. Agrawala","doi":"10.1109/REAL.1989.63577","DOIUrl":"https://doi.org/10.1109/REAL.1989.63577","url":null,"abstract":"It is well known that the optimal nonpreemptive scheduling of n tasks on a single processor requires a number of operations proportional to the factorial of the number of tasks. It is proposed that tasks be scheduled in two steps. In the first step a sequence for the tasks is generated, and in the second step the tasks are bounded in time according to the selected sequence by assigning a start time for each task. In the general case the proposed decomposition scheduling scheme divides the n tasks into m subsets, and the tasks are scheduled within each subset. The complexity of the approach is determined when the tasks in a subset are scheduled using exhaustive search procedures.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814808","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":"Events: a structuring mechanism for a real-time runtime system","authors":"Marc D. Donner, D. Jameson, W. Moran","doi":"10.1109/REAL.1989.63553","DOIUrl":"https://doi.org/10.1109/REAL.1989.63553","url":null,"abstract":"Recent progress in the implementation of the ORE real-time programming language is reported. A summary of the important features of the language is included. Progress in designing a runtime system for the language is reported. The design issues are discussed. A model of ORE processes is described. The set of operations defined on events, strips, and processes is described. Examples of the implementation of specific ORE features using this mechanism are illustrated.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286126","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":"Algorithm-based error detection for signal processing applications on a hypercube multiprocessor","authors":"V. Balasubramanian, P. Banerjee","doi":"10.1109/REAL.1989.63564","DOIUrl":"https://doi.org/10.1109/REAL.1989.63564","url":null,"abstract":"In many cases, it may be possible to redesign parallel algorithms so as to provide a low-cost online scheme for hardware error detection without any hardware modifications. This approach is called algorithm-based error detection. Two useful computations in signal processing are analyzed: QR factorization and singular-value decomposition. For each of these applications, numerous ways of applying algorithm-based error detection using different system-level encoding strategies are investigated. Different schemes have been observed to result in varying error coverages and time overheads. The results of studies performed on a 16-processor Intel iPSC-2/D4/MX hypercube multiprocessor are reported.<<ETX>>","PeriodicalId":324709,"journal":{"name":"[1989] Proceedings. Real-Time Systems Symposium","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367052","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}