{"title":"On the false path problem in hard real-time programs","authors":"P. Altenbernd","doi":"10.1109/EMWRTS.1996.557827","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557827","url":null,"abstract":"The paper addresses the important subject of estimating the worst case execution time (WCET) of hard real time programs essentially needed for further evaluation of real time systems. Purely structure oriented methods, analysing the control flow of the program without taking into account functional dependencies, tend to overestimate the execution time. An exact solution of this NP complete problem is impossible for larger applications. We propose a new heuristic of finding an estimate on the WCET. It provides a reasonable tradeoff between analysis results and analysis efforts: the results will still be better than purely structure oriented methods without spending too much time on finding an exact solution. For this purpose our approach does not need any user annotations except for maximum loop counts and maximum recursion depths. The actual algorithm combines pruned path enumeration with the concept of symbolic execution.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859454","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":"An ASIC supporting external clock synchronization for distributed real-time systems","authors":"K. Schossmaier, D. Loy","doi":"10.1109/EMWRTS.1996.557941","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557941","url":null,"abstract":"Designing clock synchronization algorithms for distributed real-time systems based on packet networks requires to decide on the amount and functionality of proper hardware support. Targeting a 1 /spl mu/s precision and similar accuracy measures in case of external UTC supply from GPS-receivers, this paper describes pertinent features of a peripheral device called UTCSU manufactured as an ASIC. The most salient one is the introduction of an adder-based clock, that allows a fine grained rate adjustment, continuous amortization, and maintenance of local accuracy intervals.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122792965","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":"Tuning parameters to improve a heuristic method: more and better solutions to an NP-hard real-time problem","authors":"E. Ferro, Jorge Santos, J. Orozco, R. Cayssials","doi":"10.1109/EMWRTS.1996.557788","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557788","url":null,"abstract":"The paper presents a tuned heuristic method to solve the NP-hard problem of assigning a set of preemptible tasks with placement, resource, communication, time and precedence constraints to a set of heterogeneous processors. Depending on the tuning parameters, two versions are described. They produce more and better (e.g. with a less loaded communication network) solutions than the untuned version. Time to obtain the first solution and the number of solutions found for different known problems are given.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121118488","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 data priority reload technique for real-time main memory databases","authors":"Jing Huang, L. Gruenwald","doi":"10.1109/EMWRTS.1996.557825","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557825","url":null,"abstract":"A data priority reload algorithm is proposed for real time main memory database systems that allows transaction processing to be resumed before the entire database is recovered from a system failure. Transaction execution priority, reload priority and reload preemption are taken into account during the reload process; this enables transactions with high execution priorities to have more opportunities to meet their deadlines and thus enhances the overall system performance. This algorithm also gives temporal data a higher reload priority than persistent data so that many temporal data can be used before losing their validity, which in turn minimizes the number of transactions aborted or delayed due to invalid data access. Based on the simulation results obtained, we can draw the following conclusions: the data priority reload algorithm provides a significant performance improvement over the conventional reload approach; whether the efficiency of different reload algorithms is crucial to the overall performance mainly depends on the system load, database size and system failure rate; the key factors of the design of real time MMDB reload algorithms are system unavailability, transaction execution priority, and reload threshold. In order to derive an efficient reload scheme, these factors must be studied carefully.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122602424","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":"An architectural overview of a software supervisor","authors":"T. Savor, R. Seviora","doi":"10.1109/EMWRTS.1996.557792","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557792","url":null,"abstract":"Specification-based software supervision is an approach to the automatic run-time detection of failures. The supervisor is a unit that monitors the inputs and outputs of a target software system and reports discrepancies between specified and observed behaviors as failures. Two fundamental issues arise in supervision. The first is due to specification non-determinisms. The major difficulty being that the supervisor is required to consider all legitimate behavioral alternatives to avoid erroneous failure reports. In some cases, this results in significant supervisor time and space complexities. The second issue deals with continuation of supervision after a failure was detected. The major problem is that after a failure is detected, the supervisor no longer has definite knowledge about the specification state of the target system which can result in in spurious failure reports. This paper describes a software supervisor architecture for target systems whose specifications are expressed in communicating extended finite state machine-based formalisms. The architecture includes several independent mechanisms, each tailored to resolving a specific ambiguity occurring within the software supervisor. Included are mechanisms for resolving specification non-determinism and identifying the state of the target system after a failure is detected.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974438","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":"Deriving real-time requirements for software from safety analysis","authors":"J. Górski, Andrzej Wardzinski","doi":"10.1109/EMWRTS.1996.557782","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557782","url":null,"abstract":"One of the main problems in industrial applications of computer systems is software safety, i.e. question if software can contribute (often indirectly, through a long chain of intermediary events) to an accident. Adequate identification and definition of safety requirements is crucial for safety-critical software systems. The paper presents a systematic way of derivation of software safety requirements based on a formalised model of fault trees. The approach is demonstrated through a case study. The presented approach is particularly focused on timing requirements for software which result from the safety analysis performed for the whole application.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114166769","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 dynamic real-time scheduler for shared memory multiprocessors","authors":"S. Sáez, Joan Vila i Carbó, A. Crespo","doi":"10.1109/EMWRTS.1996.557847","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557847","url":null,"abstract":"This paper presents a dynamic scheduling algorithm for multiprocessor systems which is guarantee-oriented. The algorithm is based on dynamic priority policy where priorities are inversely proportional to the latest start time (LST) of tasks. The paper includes a comparative study of the algorithm with other two well known dynamic algorithms: the earliest deadline first (EDF) and the least laxity first (LLF). The results show that LST is able to schedule some loads where EDF fails and reduces significantly the number of context switches with respect to LLF. The algorithm has been implemented and tested on a tool for multiprocessor analysis and simulation which is also presented in this paper.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122328001","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":"Evaluation of real-time and embedded systems for monitoring and optimizing industrial processes using high performance computing","authors":"F. J. Suárez, Javier García, D. García","doi":"10.1109/EMWRTS.1996.557837","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557837","url":null,"abstract":"This paper deals with the evaluation of the real-time behavior of a proposed kind of embedded systems for monitoring and optimizing industrial processes, using high performance computing. The paper begins with an introduction to the industrial environment where the embedded systems will be integrated. Following this, the physical architecture of the environment of the embedded systems is presented. The next point shows the process structure of the system and its computational model. After that, a description of the behavior analysis strategy for the embedded systems and the metrics to be considered are given. According to these metrics, the evaluation of a real industrial embedded system, a complex hot strip mill monitoring and optimizing system, running in a SN9500 platform, is shown. Finally, the conclusions and future work to be done are presented.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129952179","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 symbolic model-checking for real-time systems","authors":"S. Yamane","doi":"10.1109/EMWRTS.1996.557829","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557829","url":null,"abstract":"It is important to verify timing conditions in real time systems. In particular, symbolic model checking is promising for verifying a large system. But in dense time models, symbolic model checking based on BDD causes the state explosion problem because of generating a region graph from the specification. We propose symbolic model checking based on BDD in a dense time model, which does not use a region graph. In our proposed symbolic model checker, we represent state spaces by both BDD and DBM (Difference Bound Matrices). We have realized an effective symbolic model checker based on BDD in dense time model with the proposed method.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115083162","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}
J. Leskela, M. Salmela, J. Hyvärinen, M. Heikkinen
{"title":"Visualised real-time operating system simulation in a heterogeneous prototyping environment","authors":"J. Leskela, M. Salmela, J. Hyvärinen, M. Heikkinen","doi":"10.1109/EMWRTS.1996.557929","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557929","url":null,"abstract":"Understanding the behaviour of a complex real-time system is often a trying task for designers and implementors. The debugging tools of the target platform may be primitive, which makes the overall validation of the system laborious. Quite often the initial validation activities are moved to the development workstation where the development tool support is better. The Implementation Animator (IA) is a tool for visualization and testing of embedded real-time software in the workstation environment. It contains the simulation of a complete real-time operating system with detailed animation of the application behaviour as well as the operating system internals.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125154042","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}