{"title":"Run-time monitoring of real-time systems","authors":"S. Chodrow, F. Jahanian, Marc D. Donner","doi":"10.1109/REAL.1991.160360","DOIUrl":"https://doi.org/10.1109/REAL.1991.160360","url":null,"abstract":"A model and an implementation of a run-time environment for specifying and monitoring properties of real-time systems are presented. The proposed approach supports annotating real-time programs with events that are recorded and examined at run-time. The authors provide two general methods for synchronous or asynchronous monitoring of real-time constraints. In the synchronous case, a system constraint is embedded inside a program; thus, the constraint is examined at a particular point in the execution of a real-time task. In the asynchronous case, a constraint is monitored by a separate task during the entire execution of real-time tasks. The authors also describe an implementation of a run-time monitoring toolkit as a set of library function calls in C.<<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":"133880722","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":"Hartstone distributed benchmark: requirements and definitions","authors":"N. I. Kamenoff, N. Weiderman","doi":"10.1109/REAL.1991.160374","DOIUrl":"https://doi.org/10.1109/REAL.1991.160374","url":null,"abstract":"A series of benchmark requirements, the Hartstone distributed benchmark (HDB), to be used in testing the ability of real-time distributed systems (RTDSs), to handle real-time applications, is defined. The HDB experiments deliver figures of merit for the end-to-end scheduling of messages, which integrates the processor scheduling domain and the communication scheduling domain. In the HDB experiments, the entire communication system on each node (hardware and communication software) is presented in the host processor space as a communication server (CS). The CS is reviewed in the processor space as an aperiodic server task which executes on behalf of its clients. The HDB experiments are defined for datagram (acknowledged and unacknowledged) services, virtual-circuit services and integrated protocol services. Experiments for aperiodic activities are defined as well. Dedicated experiments are defined for testing the channel-access protocol, whose serializing nature can lead to priority inversions in the communication media.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"9 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133076082","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":"MACS: a predictable architecture for real time systems","authors":"B. Cogswell, Z. Segall","doi":"10.1109/REAL.1991.160386","DOIUrl":"https://doi.org/10.1109/REAL.1991.160386","url":null,"abstract":"The MACS (multiple active context system) architecture is a high-performance, multiple context, cacheless processor designed around the goal of predictability. Multiple contexts provide highly predictable memory and pipeline performance, while at the same time allowing multiple threads to execute with independent timing characteristics. The design emphasis is on provable execution speed and independent timing of each context. Task-level parallelism is used to maintain high processor throughput while individual threads execute at a relatively slow, but very predictable, rate. The authors investigate the suitability of such a system to real time and determine how predictability varies as a function of parallelism (performance), memory issue latency and memory size.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"21 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":"122488856","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 sharing with consideration of future task arrivals in heterogeneous distributed real-time systems","authors":"J. Hou, K. Shin","doi":"10.1109/REAL.1991.160362","DOIUrl":"https://doi.org/10.1109/REAL.1991.160362","url":null,"abstract":"The authors propose a new loading sharing (LS) algorithm for real-time applications that accounts for the effect of future task arrivals on locating the best receiver for each unguaranteed task. The LS algorithm minimizes not only the probability of transferring an unguaranteed task T to an incapable node with Bayesian analysis, but also the probability that a remote node fails to guarantee T because of future arrivals of higher-laxity tasks with queuing analysis. All parameters needed for a node's LS decision are collected/estimated online using time-stamped region-change broadcasts and Bayesian estimation. Simulation results show that the proposed LS algorithm outperforms other existing algorithms in minimizing the probability of dynamic failure, task collisions, and excessive task transfers. The performance improvement becomes more pronounced as the degree of system heterogeneity increases.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"14 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":"116692973","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":"Fixed priority scheduling periodic tasks with varying execution priority","authors":"M. G. Harbour, Mark H. Klein, J. Lehoczky","doi":"10.1109/REAL.1991.160365","DOIUrl":"https://doi.org/10.1109/REAL.1991.160365","url":null,"abstract":"The problem of fixed priority scheduling of periodic tasks where each task's execution priority may vary is considered. Periodic tasks are decomposed into serially executed subtasks, where each subtask is characterized by an execution time and a fixed priority and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theoretical underpinnings. This method can be used to analyze the schedulability of complex task sets which involve interrupts, certain synchronization protocols, nonpreemptible sections and, in general, any mechanism that contributes to a complex priority structure. The authors introduce a simple but realistic real-time robotics application and illustrate how one uses the schedulability equations presented.<<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":"128118435","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":"Optimization in real time","authors":"Lon-Chan Chu, B. Wah","doi":"10.1109/REAL.1991.160368","DOIUrl":"https://doi.org/10.1109/REAL.1991.160368","url":null,"abstract":"A search algorithm called real-time search (RTS) for solving combinatorial optimization problems under real-time constraints is presented. The algorithm aims at finding the best possible solution within a given deadline. Since this objective is generally not achievable without first solving the problem, the authors use an alternative heuristic objective that looks for the solution with the best ascertained approximation degree. The algorithm schedules a sequence of guided depth-first searches, each searching for a more accurate solution (based on the approximation degree set), or solutions deeper in the search tree (based on the threshold set), or a combination of both. Five versions of the RTS algorithm for setting approximation degrees and/or thresholds are formulated, evaluated, and analyzed. The authors describe the experimental results obtained for the five versions of RTS.<<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":"128569612","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 a predictable avionics platform in Ada: a case study","authors":"C. D. Locke, D. R. Vogel, T. J. Mesler","doi":"10.1109/REAL.1991.160372","DOIUrl":"https://doi.org/10.1109/REAL.1991.160372","url":null,"abstract":"In an effort to promote the use of Ada in embedded system development, a realistic avionics application model whose hard real-time properties are fully predictable has been generated. This was done starting with a rate monotonic analysis of a set of typical fully synchronized periodic and aperiodic avionics tasks drawn from an idealized attack aircraft mission computer. The authors describe this avionics case study and its goals, examine the resulting design issues and trade-offs, and investigate the ability of the rate monotonic analysis model to predict its performance under a heavy load.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"30 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":"129411378","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":"Specification and verification of real-time embedded systems using time-constrained reactive automata","authors":"Azer Bestavros","doi":"10.1109/REAL.1991.160380","DOIUrl":"https://doi.org/10.1109/REAL.1991.160380","url":null,"abstract":"The authors briefly review the time-constrained reactive automata (TRA) model and its use in the specification and verification of real-time embedded systems. Among its salient features is a fundamental notion of space and time that restricts the expensiveness of the model in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA formalism, there is no conceptual distinction between a system and a property; both are specified as formal objects. This reduces the verification process to that of establishing correspondences-namely preservation and implementation relationships-between such objects.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"29 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":"114588577","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}
Jiandong Huang, J. Stankovic, K. Ramamritham, D. Towsley
{"title":"On using priority inheritance in real-time databases","authors":"Jiandong Huang, J. Stankovic, K. Ramamritham, D. Towsley","doi":"10.1109/REAL.1991.160376","DOIUrl":"https://doi.org/10.1109/REAL.1991.160376","url":null,"abstract":"The authors investigate solutions to the priority inversion problem in a real-time database where two-phase locking is employed for concurrency control. They examine two basic schemes for addressing the priority inversion problem, one based on priority inheritance and the other based on priority abort. The authors also study a new scheme, called conditional priority inheritance, which attempts to capitalize on the advantage of each of the two basic schemes. The performance studies, conducted on a real-time database testbed, indicated that the basic priority inheritance protocol is inappropriate for solving the priority inversion problem in real-time database systems. The authors also show that the conditional priority inheritance scheme and the priority abort scheme perform well for a wide range of system workloads.<<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":"129936504","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":"Towards an automatic synthesis system for real-time software","authors":"Tobiah E. Smith, D. Setliff","doi":"10.1109/REAL.1991.160356","DOIUrl":"https://doi.org/10.1109/REAL.1991.160356","url":null,"abstract":"An automatic synthesis system for real-time software is described. It is argued that the presence of strict operation requirements, such as task-level timing constraints and compiler and target platform constraints, guides synthesis. An automatic software synthesis system, RT-SYN, integrates platform characteristics to synthesize real-time software which meets hard deadline design requirements. The RT-SYN system has four key features. First, a visual graphical user interface captures application algorithms without implementation specifications. Second, RT-SYN analyzes the task-level data and control flows to produce worst-case timing and space predictions. Third, RT-SYN uses these predictions to choose abstract representations of data structure and algorithm implementations to meet required timing and space constraints. Fourth, RT-SYN synthesizes C code from the selected implementations. Experimental results are given to illustrate these four features.<<ETX>>","PeriodicalId":409237,"journal":{"name":"[1991] Proceedings Twelfth Real-Time Systems Symposium","volume":"38 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":"115950301","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}