A. Ciuffoletti, Federica Gattai, Roberta Golinelli
{"title":"Clock synchronization in virtual rings","authors":"A. Ciuffoletti, Federica Gattai, Roberta Golinelli","doi":"10.1109/EMWRTS.1994.336862","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336862","url":null,"abstract":"A probabilistic algorithm for external clock synchronization is proposed. The algorithm works under the assumption that it is possible to identify a virtual ring among the servers involved, and does not require an upper bound to message transmission delays. The approach is probabilistic, since clock synchronization is not guaranteed, but the probability of success can be made arbitrarily close to one. The precision is comparable with that achievable with other probabilistic protocols, with the advantage that all the nodes can synchronize their clocks within the same attempt. A Pascal-like description of the protocol is given, and a formal proof of its correctness is outlined.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678529","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":"Pinwheel scheduling with three distinct numbers","authors":"Shun-Shii Lin, Kwei-Jay Lin","doi":"10.1109/EMWRTS.1994.336846","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336846","url":null,"abstract":"Given a multiset of positive integers A={a/sub 1/, a/sub 2/, ..., a/sub n/}, the pinwheel problem is to find an infinite sequence over { 1, 2,..., n} such that there is at least one symbol i within any subsequence of length a/sub i/. The density of A is defined as /spl rho/(A)=/spl Sigmasub i=1sup n/ (1/a/sub i/). We limit ourselves to instances composed of three distinct integers. Currently, the best scheduler can schedule such instances with a density less than 0.77. A new and fast scheduling scheme based on spectrum partitioning is proposed which improves the 0.77 result to a new 5/6/spl ap/0.83 density threshold. This scheduler has achieved the exact theoretical bound of this problem.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121883982","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":"Interprocessor-blocking independent static task allocation for shared-bus real-time multiprocessors","authors":"Chang Yeol Choi, Heonshik Shin, Yookun Cho","doi":"10.1109/EMWRTS.1994.336865","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336865","url":null,"abstract":"In real-time systems, guaranteeing the schedulability of high priority tasks is more important than being able to schedule more tasks under resource constraints. The system bus in bus-based multiprocessors is a shared resource that is usually arbitrated by priority and fairness. This paper presents a new static task allocation strategy that takes into consideration the impact of bus arbitration policy on schedulability. By allocating task sets, partitioned by descending order of priorities, to the processors in the order of physical priorities, we can minimize the loss of schedulability caused by interference among processors. It is shown via simulation that the proposed strategy keeps high priority tasks schedulable and reduces the schedulability loss up to 26% compared with the conventional allocation scheme.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015365","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":"Modular specification of real-time systems","authors":"Recep Inal","doi":"10.1109/EMWRTS.1994.336871","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336871","url":null,"abstract":"Duration Calculus, a real-time interval logic, has been embedded in the Z specification language to provide a notation for real-time systems that combines the modularisation and abstraction facilities of Z with a logic suitable for reasoning about real-time properties. In this article the notation is presented through a top-level specification of requirements for a simple air traffic monitoring system, and reasoning is illustrated by a refinement towards a design.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128508744","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":"Supporting real-time update of an environment representation for autonomous mobile robots","authors":"G. Magin, A. Ruß","doi":"10.1109/EMWRTS.1994.336868","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336868","url":null,"abstract":"A model of the environment is a mandatory requirement for the autonomy of a mobile robot. As the environment may change over time, methods are necessary to update the model information, keeping pace with the sensor frame rate. Our approach to cope with this real time problem is to predict virtual sensor images, which are then compared against the real perceptions. Two alternative methods are detailed: model based prediction and history based prediction.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128967176","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":"Algorithms for scheduling computations with secondary deadlines to minimize penalty","authors":"C. Han, Kwei-Jay Lin","doi":"10.1109/EMWRTS.1994.336851","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336851","url":null,"abstract":"In many real-time applications, some job allows part of its computation to be executed after its primary deadline but before an extended, or secondary deadline. We study the scheduling issues for real-time computations with secondary deadlines. We call the part of a computation which must be completed before the primary deadline its hard part, and the rest its soft part. The soft part of a computation can be delayed after its primary deadline but must be finished before its secondary deadline. Although the computations have secondary deadlines, it is still desirable to finish the complete computations before their primary deadlines. Therefore, the system receives a penalty for each soft part that finishes after the primary deadline. We present scheduling algorithms for the model which minimizes the total penalty or the maximum penalty.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130676046","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":"Modeling and scheduling real-time control systems with relative consistency constraints","authors":"P. Raja, L. Ruiz, J. Decotignie","doi":"10.1109/EMWRTS.1994.336866","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336866","url":null,"abstract":"Control applications control and monitor an external physical environment. Process control and manufacturing systems are examples of such applications. In such systems the temporal relationship between the external environment and the control system plays an important role. In this paper, the temporal relationship of data within the control system and the external environment, known as data temporal consistency, is considered. First the control system is modeled as a graph of periodic tasks. Then the problem of scheduling a set of periodic tasks on a uniprocessor with the relative consistency as a scheduling constraint is studied and its computational complexity is investigated. A novel aspect of the scheduling problem is with respect to the scheduling constraints. More precisely, it is shown how the relative phasing of a periodic task is constrained by the relative phasings of its predecessor tasks.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127232806","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 derivation of scheduling algorithms from a timing model","authors":"M. Filali","doi":"10.1109/EMWRTS.1994.336845","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336845","url":null,"abstract":"We first present a timing model for describing the temporal behaviour of a real-time application. Then, within this model, we specify formally the scheduling problem through a relation between so called temporal profiles. We show how this relation can be generically decomposed and implemented on different machine architectures.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127628675","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 networks for multiprocessor real-time scheduling","authors":"C. Cardeira, Z. Mammeri","doi":"10.1109/EMWRTS.1994.336864","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336864","url":null,"abstract":"In recent years, neural networks have become a popular area of research, especially after Hopfield and Tank opened the way for using neural networks for optimization purposes and surprised the scientific community by their paper (Biological Cybernetics, vol. 52, pp. 141-52, 1985) presenting a circuit to give approximate solutions for the classical traveling salesman problem in a few elapsed propagation times of analog amplifiers. In this paper, we analyze Hopfield neural networks from the scheduling viewpoint to see if they can be used to solve real-time scheduling problems. We build a neural network whose topology depends on real-time task constraints, and converges to an approximate solution of the scheduling problem. Finally, we analyze the quality of the result in terms of the convergence rate and the complexity of the algorithm.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123508638","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":"Object-based design of embedded software using real-time operating systems","authors":"P. Pesonen, V. Seppänen","doi":"10.1109/EMWRTS.1994.336843","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336843","url":null,"abstract":"Embedded systems are used in everyday electronic consumer products and industrial equipment, e.g. television sets, radios, cars, and mobile phones. Rapid developments which have taken place in computer hardware and software technologies have led to the increased complexity of embedded systems. Promising results have been achieved in the development of complex information processing systems using object-oriented methods. However, such methods have not been much used in the development of embedded software. Many features specific to the development of embedded software are not adequately supported by the current object-oriented and object-based design methods. This paper demonstrates how the results of object-oriented analysis can be mapped to designs using conventional real-time operating systems (RTOS). In particular, useful results in object-based design of embedded software can be obtained in a short term. This adaptive approach can be used as an intermediate step towards a \"pure\" object-oriented approach.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132826936","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}