{"title":"Design of a real-time trader for mobile objects in open distributed environments","authors":"Song-Yi Yi, Heonshik Shin","doi":"10.1109/EMWRTS.1996.557918","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557918","url":null,"abstract":"Advances in wireless communication and distributed computing will create a new computing environment where mobile objects can work in real-time over heterogeneous systems anywhere and at any time. In this environment, real-time traders which can perform trading services under timing constraints are required. In this paper we identify design issues of a real-time trader for mobile objects and investigate them. Our work focuses on the design of real-time trading mechanism, trading interfaces, and the interactions of interworking traders to provide real-time trading services for mobile clients and servers.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"51 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":"125021913","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}
Y. Tanurhan, S. Schmerler, A. Winter, K. Müller-Glaser
{"title":"A rapid prototyping approach for specification and design of distributed automotive control systems","authors":"Y. Tanurhan, S. Schmerler, A. Winter, K. Müller-Glaser","doi":"10.1109/EMWRTS.1996.557895","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557895","url":null,"abstract":"This paper presents a methodology for the design of microelectronic embedded systems, which include hardware and software for open-loop and closed-loop control in the area of automotive bus and control systems. An integrated approach to specification and design, analysis and simulation of the overall system has been developed. As embedded systems often require real-time capabilities, the environment presented gives special consideration to these constraints. An example for a concrete application will be given, which shows, how the design of real-time systems is supported by this design methodology using a Rapid Prototyping environment.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"173 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":"126780146","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 Wizard: a design and assessment tool for real-time applications","authors":"S. Cavalcante, D. Kinniment","doi":"10.1109/EMWRTS.1996.557784","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557784","url":null,"abstract":"Time Wizard, the tool we present, is aimed at the design and assessment of applications for real-time applications. It permits the assessment of the system not only at the inter-task level but at the intra-task level as well. It helps the designer to fine tune the task implementation, providing tight bounds for worst case analysis, and helping to decide among implementation alternatives. At the specification level, Time Wizard's extensions to Petri nets provide better modularisation of the design while enforcing a methodology for producing consistent real-time designs. Time Wizard is part of a bigger system aimed at hardware-software codesign but, being self-contained, it may be used as a separate tool for real-time system specification.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"8 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":"128262404","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 programmable concurrency control service for real-time object request brokers","authors":"E. Grasso","doi":"10.1109/EMWRTS.1996.557924","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557924","url":null,"abstract":"Concurrency is a paramount concern in a real-time system, where a trade-off exists between high availability on the one hand and application consistency on the other. Transactions are a useful instrument to guarantee consistency of applications, though they have traditionally been investigated in the context of conventional database applications. Yet, the full observation of all ACID properties of traditional transactions may not neatly fit the demands of real-time applications such as in the case of a telecom environment. A Transaction Service must rely on a Concurrency Control Service (CCS) to coordinate access to shared objects and ensure isolation of concurrent transactional activities. A traditional CCS based on a predefined set of lock modes is too restrictive for real-time applications and a mote general model is needed for allowing more parallelism of applications. We propose a Programmable Concurrency Control Service (PCCS) that allows the programmer to set their own concurrency level tailored to application semantics.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"69 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":"114690261","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":"Priority inversion at the network adapter when scheduling messages with earliest deadline techniques","authors":"A. Meschi, M. Natale, M. Spuri","doi":"10.1109/EMWRTS.1996.557931","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557931","url":null,"abstract":"In this paper we present a novel approach in the study of the predictability of real-time message transmission and its relationship with the design of network adapters for real-time distributed systems. The aim is to limit the occurrence of large priority inversions among messages, so as to achieve a better degree of predictability. We show that when the proper network adapters are used in conjunction with earliest deadline message scheduling the loss in processor utilization is minimized and predictable.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"22 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132398544","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 hybrid genetic algorithm applied to automatic parallel controller code generation","authors":"F. Sandnes, G. Megson","doi":"10.1109/EMWRTS.1996.557799","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557799","url":null,"abstract":"High performance real-time digital controllers employ parallel hardware such as transputers and digital signal processors to achieve short response times when this is not achievable with conventional uni-processor systems. Implementing such fine-grained parallel software is error-prone and difficult. We show how a hybrid genetic algorithm can be applied to automate this parallel code generation for a set of regular control problems such that significant speedup is obtained with few constraints on hardware. Genetic algorithms are particularly suited to this problem since the mapping problem is combinatorial in nature. However, one drawback of the genetic algorithm is that it is sensitive to small changes in the problem size. To overcome this problem the presented approach partitions the original problem into sub-problems, called boxes. The scheduling of these boxes is similar to the VLSI placement problem.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"93 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":"134161438","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}
Hyungill Kim, Sungyoung Lee, Jongwon Lee, Dougyoung Suh
{"title":"A near-optimal algorithm for scheduling soft-aperiodic requests in dynamic priority systems","authors":"Hyungill Kim, Sungyoung Lee, Jongwon Lee, Dougyoung Suh","doi":"10.1109/EMWRTS.1996.557932","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557932","url":null,"abstract":"In this paper we propose a reasonably simple and near-optimal soft-aperiodic task scheduling algorithm in dynamic priority systems. The proposed algorithm has extended the EDF-CTI (Earliest Deadline First-Critical Task Indicating) Algorithm in such a way of modifying the slack calculation method which in turn reduces the computational complexity of slack calculation and resolves the unit scheduling problems. The paper also demonstrates near optimality of the algorithm. Our simulation study shows that the proposed algorithm, in most cases, is slightly better than the EDF-CTI algorithm in terms of short response time of aperiodic requests in a high workload.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"88 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":"124167911","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}
P. Bizzarri, A. Bondavalli, F. Giandomenico, F. Tarini
{"title":"Planning the execution of task groups in real-time systems","authors":"P. Bizzarri, A. Bondavalli, F. Giandomenico, F. Tarini","doi":"10.1109/EMWRTS.1996.557850","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557850","url":null,"abstract":"Many real-time applications are designed such that not only simply individual tasks but also groups of tasks can be executed satisfying a common real time requirement. Examples are real time transactions executed in a distributed environment, applications with end-to-end constraints and real-time applications with some dependability requirements in which redundancy is introduced for fault tolerance purposes. This paper investigates the problem of planning groups of tasks in real-time environments. It first discusses the issues related to the design choices and their implications on planning strategies for tasks groups. Then an algorithm for planning groups of tasks is proposed for the specific case of fault tolerant real-time applications where fault tolerance is realised by groups of tasks forming together fault tolerant structures.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"53 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":"114875903","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. Busquets-Mataix, J. J. Serrano, Rafael Ors Carot, P. Gil, A. Wellings
{"title":"Adding instruction cache effect to an exact schedulability analysis of preemptive real-time systems","authors":"J. Busquets-Mataix, J. J. Serrano, Rafael Ors Carot, P. Gil, A. Wellings","doi":"10.1109/EMWRTS.1996.557940","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557940","url":null,"abstract":"Cache memories are commonly avoided in real-time systems because of their unpredictable behavior. Recently, some research has been done to obtain tighter bounds on the worst case execution time (WCET) of cached programs. These techniques usually assume a non preemptive underlying system. However, some techniques can be applied to allow the use of caches in preemptive systems. This paper describes how to incorporate the effect of instruction cache to the Response Time schedulability Analysis (RTA). RTA is an efficient analysis for preemptive fixed priority schedulers. We also compare through simulations the results of such an approach to the previously available CRMA (Cached RMA: cache effect is incorporated in the utilization based Rate Monotonic schedulability analysis). The results show that the cached version of RTA (CRTA) clearly outperforms CRMA.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"12 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":"126150029","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":"Neural network versus max-flow algorithms for multiprocessor real-time scheduling","authors":"C. Cardeira","doi":"10.1109/EMWRTS.1996.557852","DOIUrl":"https://doi.org/10.1109/EMWRTS.1996.557852","url":null,"abstract":"Neural networks have been widely used in a large area of applications, like image processing, learning processes, identification and control, etc. but there is a lack for their use for approximate solving real-time scheduling problems. The authors have already shown the ability of a neural network based scheduling algorithm to deal with the scheduling of independent real-time tasks in a multiprocessor environment. The algorithm is approximate but has a remarkable convergence speed due to the highly parallel nature of the search. In recent literature, the authors have analyzed the performance of the algorithm when compared with the well-known rare monotonic and earliest deadline algorithms for the monoprocessor case. In this paper we present an analysis of the quality of the yielded solution for the multiprocessor case.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"85 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":"121469792","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}