Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776399
L. Thomas, Thomas Lambolais, Renaud Lesiour
Our goal is to settle techniques for the validation of real time distributed systems. We opted for executable models and simulation techniques. Our approach is to work at the architectural level of a system abstraction. The software architecture is understood as a set of structures comprising software components with external properties and relationships among them. We devised a language to describe those components and the logical structure of the architecture. It is a specialization and extension of object oriented modeling languages designed to deal with concurrency, reactivity and architectural concerns. This language is based on a notion of components defined similarly to the class notion, extended for the timing requirements. Execution and simulation are driven to validate behaviors with respect to desired properties.
{"title":"Architectural techniques for the description and validation of distributed real-time systems","authors":"L. Thomas, Thomas Lambolais, Renaud Lesiour","doi":"10.1109/ISORC.1999.776399","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776399","url":null,"abstract":"Our goal is to settle techniques for the validation of real time distributed systems. We opted for executable models and simulation techniques. Our approach is to work at the architectural level of a system abstraction. The software architecture is understood as a set of structures comprising software components with external properties and relationships among them. We devised a language to describe those components and the logical structure of the architecture. It is a specialization and extension of object oriented modeling languages designed to deal with concurrency, reactivity and architectural concerns. This language is based on a notion of components defined similarly to the class notion, extended for the timing requirements. Execution and simulation are driven to validate behaviors with respect to desired properties.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127475141","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776385
J. Maisonneuve, S. Chabridon, P. Leveille
The PERCO platform is an industry-provided software platform that specifically addresses the requirements of highly available, dependable autonomous systems. Its basic tenet is to use UML specifications to build as much of the application as possible, while integrating real-time and fault-tolerant properties at the architectural level. PERCO was designed and built within the Alcatel-Thomson Common Laboratory (LCAT).
{"title":"The PERCO platform","authors":"J. Maisonneuve, S. Chabridon, P. Leveille","doi":"10.1109/ISORC.1999.776385","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776385","url":null,"abstract":"The PERCO platform is an industry-provided software platform that specifically addresses the requirements of highly available, dependable autonomous systems. Its basic tenet is to use UML specifications to build as much of the application as possible, while integrating real-time and fault-tolerant properties at the architectural level. PERCO was designed and built within the Alcatel-Thomson Common Laboratory (LCAT).","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122135385","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776386
Toshihiro Kamiya, S. Kusumoto, Katsuro Inoue
To analyse the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's (1994) metrics are well-known object-oriented metrics. Also, their effectiveness has been empirically evaluated from the viewpoint of estimating the fault-proneness of object-oriented software. In the evaluations, these metrics were applied, not to the design specification but to the source code, because some of them measure the inner complexity of a class, and such information cannot be obtained until the algorithm and the class structure are determined at the end of the design phase. However, the estimation of the fault-proneness should be done in the early phase so as to effectively allocate effort for fixing the faults. This paper proposes a new method to estimate the fault-proneness of an object class in the early phase, using several complexity metrics for object-oriented software. In the proposed method, we introduce four checkpoints into the analysis/design/implementation phase, and we estimate the fault-prone classes using applicable metrics at each checkpoint.
{"title":"Prediction of fault-proneness at early phase in object-oriented development","authors":"Toshihiro Kamiya, S. Kusumoto, Katsuro Inoue","doi":"10.1109/ISORC.1999.776386","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776386","url":null,"abstract":"To analyse the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's (1994) metrics are well-known object-oriented metrics. Also, their effectiveness has been empirically evaluated from the viewpoint of estimating the fault-proneness of object-oriented software. In the evaluations, these metrics were applied, not to the design specification but to the source code, because some of them measure the inner complexity of a class, and such information cannot be obtained until the algorithm and the class structure are determined at the end of the design phase. However, the estimation of the fault-proneness should be done in the early phase so as to effectively allocate effort for fixing the faults. This paper proposes a new method to estimate the fault-proneness of an object class in the early phase, using several complexity metrics for object-oriented software. In the proposed method, we introduce four checkpoints into the analysis/design/implementation phase, and we estimate the fault-prone classes using applicable metrics at each checkpoint.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114641546","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776345
S. Leue, G. Holzmann
Describes the design of VIP (Visual Interface for Promela), a graphical front-end to the model checker SPIN. VIP supports a visual formalism, called v-Promela, that connects the model checker to modern hierarchical notations for the specification of object-oriented, reactive systems. The formalism is comparable to formalisms such as UML-RT (Unified Modeling Language for Real-Time systems), ROOM (Real-time Object-Oriented Modeling) and Statecharts, but is presented in this paper in a framework that allows us to combine the benefits of a visual, hierarchical specification method with the power of LTL (linear temporal logic) model checking provided by SPIN. Like comparable formalisms, VIP can describe hierarchies of behaviour and of system structure. The formalism is designed to be transparent to the SPIN model checker itself, by allowing all central constructs to be translated mechanically into basic Promela, as already supported by the existing model checker.
介绍了模型检查器SPIN的图形前端VIP (Visual Interface for Promela)的设计。VIP支持一种称为v-Promela的可视化形式，它将模型检查器连接到面向对象、响应式系统规范的现代分层符号。这种形式化可以与UML-RT(实时系统统一建模语言)、ROOM(实时面向对象建模)和Statecharts等形式化相媲美，但本文在一个框架中提出，该框架允许我们将可视化、分层规范方法的好处与SPIN提供的LTL(线性时间逻辑)模型检查的功能结合起来。与类似的形式主义一样，VIP可以描述行为和系统结构的层次结构。通过允许将所有中心构造机械地转换为基本Promela，就像现有模型检查器已经支持的那样，将形式化设计为对SPIN模型检查器本身透明。
{"title":"v-Promela: a visual, object-oriented language for SPIN","authors":"S. Leue, G. Holzmann","doi":"10.1109/ISORC.1999.776345","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776345","url":null,"abstract":"Describes the design of VIP (Visual Interface for Promela), a graphical front-end to the model checker SPIN. VIP supports a visual formalism, called v-Promela, that connects the model checker to modern hierarchical notations for the specification of object-oriented, reactive systems. The formalism is comparable to formalisms such as UML-RT (Unified Modeling Language for Real-Time systems), ROOM (Real-time Object-Oriented Modeling) and Statecharts, but is presented in this paper in a framework that allows us to combine the benefits of a visual, hierarchical specification method with the power of LTL (linear temporal logic) model checking provided by SPIN. Like comparable formalisms, VIP can describe hierarchies of behaviour and of system structure. The formalism is designed to be transparent to the SPIN model checker itself, by allowing all central constructs to be translated mechanically into basic Promela, as already supported by the existing model checker.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491722","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776388
P. Ezhilchelvan, S. Shrivastava
In a distributed system, replication of components, such as objects, is a well known way of achieving availability. For increased availability, crashed and disconnected components must be replaced by new components on available spare nodes. In this context, we address the problem of reconfiguring a group after the group as an entity has failed. Such a failure is termed a group failure which, for example, can be the crash of every component in the group or the group being partitioned into minority islands. The solution assumes crash-proof storage, and eventual recovery of crashed nodes and healing of partitions. It guarantees that: (i) the number of groups reconfigured after a group failure is never more than one, and (ii) the reconfigured group contains a majority of the components which were members just before the group failed, so that the loss of state information due to group failure is minimal. The protocol is efficient in terms of communication rounds and use of stable store, during both normal operations and reconfiguration after a group failure.
{"title":"Enhancing replica management services to tolerate group failures","authors":"P. Ezhilchelvan, S. Shrivastava","doi":"10.1109/ISORC.1999.776388","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776388","url":null,"abstract":"In a distributed system, replication of components, such as objects, is a well known way of achieving availability. For increased availability, crashed and disconnected components must be replaced by new components on available spare nodes. In this context, we address the problem of reconfiguring a group after the group as an entity has failed. Such a failure is termed a group failure which, for example, can be the crash of every component in the group or the group being partitioned into minority islands. The solution assumes crash-proof storage, and eventual recovery of crashed nodes and healing of partitions. It guarantees that: (i) the number of groups reconfigured after a group failure is never more than one, and (ii) the reconfigured group contains a majority of the components which were members just before the group failed, so that the loss of state information due to group failure is minimal. The protocol is efficient in terms of communication rounds and use of stable store, during both normal operations and reconfiguration after a group failure.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123909313","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776352
Steven Wohlever, V. Wolfe, B. Thuraisingham, R. Freedman, J. Maurer
The paper describes an approach to building adaptable real time command and control (C2) systems. In particular it presents an overview of the Adaptable Real-Time Distributed Object Management (ARTDOM) project in progress at the MITRE Corporation. This project is currently developing real time extensions for the Common Object Request Broker Architecture (CORBA) Trading Object Service. The goal of the project is to demonstrate how current C2 systems can be more easily upgraded and made more adaptable by using emerging distributed computing technology. This goal is being accomplished by investigating and developing real time middleware that is reflexive (i.e., capable of examining its current state and processing demands) and self adapting (i.e., capable of reconfiguring itself based on its reflective findings).
{"title":"CORBA-based real-time trader service for adaptable command and control systems","authors":"Steven Wohlever, V. Wolfe, B. Thuraisingham, R. Freedman, J. Maurer","doi":"10.1109/ISORC.1999.776352","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776352","url":null,"abstract":"The paper describes an approach to building adaptable real time command and control (C2) systems. In particular it presents an overview of the Adaptable Real-Time Distributed Object Management (ARTDOM) project in progress at the MITRE Corporation. This project is currently developing real time extensions for the Common Object Request Broker Architecture (CORBA) Trading Object Service. The goal of the project is to demonstrate how current C2 systems can be more easily upgraded and made more adaptable by using emerging distributed computing technology. This goal is being accomplished by investigating and developing real time middleware that is reflexive (i.e., capable of examining its current state and processing demands) and self adapting (i.e., capable of reconfiguring itself based on its reflective findings).","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361018","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776387
R. Baldoni, Simona Bonamoneta, C. Marchetti
We investigate issues related to building highly available World Wide Web (WWW) servers on workstation clusters. We present a novel architecture that includes a dynamic Domain Name System (DNS) and a WWW server based on passive object replication. This architecture allows us to reduce the service down-time of a WWW server without impacting on the Hyper Text Transfer Protocol (HTTP) protocol (and thus on the WWW client software). We implement this architecture in our department and we show some experimental results that analyze, given a batch of HTTP requests, the average response time to a request and the average time of WWW service unavailability due to object crashes.
{"title":"Implementing highly-available WWW servers based on passive object replication","authors":"R. Baldoni, Simona Bonamoneta, C. Marchetti","doi":"10.1109/ISORC.1999.776387","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776387","url":null,"abstract":"We investigate issues related to building highly available World Wide Web (WWW) servers on workstation clusters. We present a novel architecture that includes a dynamic Domain Name System (DNS) and a WWW server based on passive object replication. This architecture allows us to reduce the service down-time of a WWW server without impacting on the Hyper Text Transfer Protocol (HTTP) protocol (and thus on the WWW client software). We implement this architecture in our department and we show some experimental results that analyze, given a batch of HTTP requests, the average response time to a request and the average time of WWW service unavailability due to object crashes.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128161818","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776394
V. Kalogeraki, P. Melliar-Smith, L. Moser
Complex soft real time distributed object systems require object profiling, scheduling and migration algorithms to respond to transient changes in the load or in the availability of the resources. We have developed a resource management system for a soft real time distributed object system that is based on a three level feedback loop which employs a profiling algorithm that monitors the usage of the resources, a least laxity scheduling algorithm that schedules the tasks, and hot spot and cooling algorithms that allocate and migrate objects to balance the load on the resources. The resource management system consists of a single (but possibly replicated and distributed) resource manager, and profilers and schedulers located on each of the processors in the distributed system.
{"title":"Using multiple feedback loops for object profiling, scheduling and migration in soft real-time distributed object systems","authors":"V. Kalogeraki, P. Melliar-Smith, L. Moser","doi":"10.1109/ISORC.1999.776394","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776394","url":null,"abstract":"Complex soft real time distributed object systems require object profiling, scheduling and migration algorithms to respond to transient changes in the load or in the availability of the resources. We have developed a resource management system for a soft real time distributed object system that is based on a three level feedback loop which employs a profiling algorithm that monitors the usage of the resources, a least laxity scheduling algorithm that schedules the tasks, and hot spot and cooling algorithms that allocate and migrate objects to balance the load on the resources. The resource management system consists of a single (but possibly replicated and distributed) resource manager, and profilers and schedulers located on each of the processors in the distributed system.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114226773","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776354
W. Fleisch
Component based software development is a promising way to improve quality, time to market and handle the increasing complexity of software for real time systems. The basic properties of an event triggered component model for real time software are introduced. For the early exposure of design errors, a process for the simulation based validation of component based software applying use cases is presented. A template for structuring use cases helps gathering the course oriented requirements which describe the required behaviour of the composed software. Requirements sequence diagrams are extracted from the use cases and compared with the simulated behaviour of the component based software. A case study of a power window control from the automotive body electronics domain demonstrates practical experience with applying use cases for the requirements validation.
{"title":"Applying use cases for the requirements validation of component-based real-time software","authors":"W. Fleisch","doi":"10.1109/ISORC.1999.776354","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776354","url":null,"abstract":"Component based software development is a promising way to improve quality, time to market and handle the increasing complexity of software for real time systems. The basic properties of an event triggered component model for real time software are introduced. For the early exposure of design errors, a process for the simulation based validation of component based software applying use cases is presented. A template for structuring use cases helps gathering the course oriented requirements which describe the required behaviour of the composed software. Requirements sequence diagrams are extracted from the use cases and compared with the simulated behaviour of the component based software. A case study of a power window control from the automotive body electronics domain demonstrates practical experience with applying use cases for the requirements validation.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114116305","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}
Pub Date : 1999-05-02DOI: 10.1109/ISORC.1999.776373
J. Kaiser, M. Mock
Designing distributed real-time systems as being composed of communicating objects offers many advantages with respect to modularity and extensibility of these systems. However, distributed real-time applications exhibit communication patterns that significantly differ from the traditional object invocation style. The publisher/subscriber model for inter-object communication matches well with these patterns. Any implementation of that model must address the problems of binding subscribers to publishers, of routing and filtering of messages, as well as reliability, efficiency and latency of message delivery. In the context of real-time applications, all these issues must be subject to a rigid inspection with respect to meeting real-time requirements. We argue that for embedded control systems built around smart microcontroller-powered devices these requirements can only be met when exploiting the properties of the underlying network. The CAN-Bus (CAN: Controller Area Network) which is an emerging standard in the field of real-time embedded systems is particularly suited to implement a publisher/subscriber model of communication. We present an implementation of the real-time publisher/subscriber model that exploits the underlying facilities of the CAN-Bus. In particular, we introduce a novel addressing scheme for publisher/subscriber communication that makes efficient use of the CAN-Bus addressing method. We provide a detailed design and implementation details along with some preliminary performance estimations.
将分布式实时系统设计为由通信对象组成，在这些系统的模块化和可扩展性方面提供了许多优势。然而，分布式实时应用程序所展示的通信模式与传统的对象调用风格有很大的不同。对象间通信的发布者/订阅者模型与这些模式非常匹配。该模型的任何实现都必须解决将订阅者绑定到发布者、路由和过滤消息以及消息传递的可靠性、效率和延迟等问题。在实时应用程序的上下文中，所有这些问题都必须受到严格的检查，以满足实时需求。我们认为，对于围绕智能微控制器供电设备构建的嵌入式控制系统，只有在利用底层网络的属性时才能满足这些要求。CAN总线(CAN: Controller Area Network)是实时嵌入式系统领域的一个新兴标准，特别适合于实现发布者/订阅者通信模型。我们提出了一个利用can总线底层设施的实时发布者/订阅者模型的实现。特别地，我们介绍了一种新的寻址方案，用于发布者/订阅者通信，它有效地利用了can总线寻址方法。我们提供了详细的设计和实现细节以及一些初步的性能估计。
{"title":"Implementing the real-time publisher/subscriber model on the controller area network (CAN)","authors":"J. Kaiser, M. Mock","doi":"10.1109/ISORC.1999.776373","DOIUrl":"https://doi.org/10.1109/ISORC.1999.776373","url":null,"abstract":"Designing distributed real-time systems as being composed of communicating objects offers many advantages with respect to modularity and extensibility of these systems. However, distributed real-time applications exhibit communication patterns that significantly differ from the traditional object invocation style. The publisher/subscriber model for inter-object communication matches well with these patterns. Any implementation of that model must address the problems of binding subscribers to publishers, of routing and filtering of messages, as well as reliability, efficiency and latency of message delivery. In the context of real-time applications, all these issues must be subject to a rigid inspection with respect to meeting real-time requirements. We argue that for embedded control systems built around smart microcontroller-powered devices these requirements can only be met when exploiting the properties of the underlying network. The CAN-Bus (CAN: Controller Area Network) which is an emerging standard in the field of real-time embedded systems is particularly suited to implement a publisher/subscriber model of communication. We present an implementation of the real-time publisher/subscriber model that exploits the underlying facilities of the CAN-Bus. In particular, we introduce a novel addressing scheme for publisher/subscriber communication that makes efficient use of the CAN-Bus addressing method. We provide a detailed design and implementation details along with some preliminary performance estimations.","PeriodicalId":211905,"journal":{"name":"Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114703290","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：