{"title":"General framework for fault tolerance from ISO/ITU Reference Model for Open Distributed Processing (RM-ODP)","authors":"J. Putman","doi":"10.1109/WORDSF.1999.842341","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842341","url":null,"abstract":"The ISO Reference Model for Open Distributed Processing (RM-ODP) is a software engineering enabler for the software architecture of distributed systems. It addresses the non-functional properties of distributed systems in terms of a framework of concepts, structuring rules, semantics and mechanisms. One such property is fault tolerance (FT). This paper provides a view of how RM-ODP addresses the FT framework. RM-ODP defines a model of FT and different recovery mechanisms that include recovery of an object, a group of objects, an interface, a binding, a bound interface, etc. Mechanisms for FT include a distinguished FT control object for the management of FT, replication, checkpoint/recovery, relocation, migration, and several transparencies to hide the FT mechanisms from the application developer. System-defined policies and schemata drive the FT. A brief comparison of this with the emerging proposal for a fault-tolerant version of the Common Object Request Broker Architecture (CORBA) is also provided.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132955664","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 precedency of messages in object-based systems","authors":"Y. Timura, Katsuya Tanaka, M. Takizawa","doi":"10.1109/WORDSF.1999.842345","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842345","url":null,"abstract":"Distributed applications are realized by the cooperation of multiple objects. The state of an object depends on the order in which request and response messages are delivered. In this paper, we define an object-based precedence relation of messages based on a conflicting relation among requests in synchronous, asynchronous and one-way nested invocations of requests. Only the messages to be ordered in the object-based system are causally delivered; hence we can reduce the communication and computation overhead required to causally deliver messages.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742514","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":"On the coordination of autonomous systems","authors":"M. Mock, E. Nett","doi":"10.1109/WORDSF.1999.842326","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842326","url":null,"abstract":"There is a general trend in designing distributed control systems to give an increasing amount of autonomy to the individual nodes of such systems. Two interrelated system layers must be considered when autonomous systems have to be coordinated under real-time constraints: the distributed programming paradigm and the communication layer. We analyze current trends and options, and give an approach for an integrated architecture.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134184840","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":"Requirements specification of an automotive system with hybrid sequence charts","authors":"R. Grosu, Ingolf Krüger, T. Stauner","doi":"10.1109/WORDSF.1999.842346","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842346","url":null,"abstract":"Outlines the key ideas behind hybrid sequence charts (HySCs), along with an example system taken from the automotive industry. HySCs are a visual description technique for communication in hybrid systems, inspired by the well-known message sequence charts syntax. However, they have a completely different semantic model that is well-suited to the application domain of hybrid systems. As a modelling example, we consider a scenario taken from the specification of an electronic height control system, which is used to adjust the chassis level of a car. HySCs can be advantageously used in the early phases of the system development process. In particular, in the requirements capture phase, they can help to improve the dialogue between customers and application experts. HySCs complement existing formalisms, like hybrid automata, by focusing on the interaction between the system's components.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"44 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002155","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 experiment with adaptive fault tolerance in highly-constrained systems","authors":"E. Shokri, P. Beltas","doi":"10.1109/WORDSF.1999.842342","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842342","url":null,"abstract":"Highly resource-constrained dependable real-time systems have a very limited number of resources which have to be managed dynamically throughout their lives. These systems also require self-contained fault tolerance capabilities while operating under dynamic environments. Varying environmental conditions, a dynamic application profile and severe constraints in resource availability necessitates a flexible and adjustable resource allocation and fault management strategy. In other words, the fault tolerance mechanism must be able to adapt itself to changes in both available resources and environmental conditions. A fault-tolerance mechanism that possesses such a characteristics is known as an adaptive fault tolerance mechanism. This paper reports an experimental investigation effort for application of adaptive fault tolerance for autonomous spacecraft.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116213106","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":"On framing object relationships to improve QoS in distributed systems","authors":"M. Mortazavi","doi":"10.1109/WORDSF.1999.842337","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842337","url":null,"abstract":"There has been a great deal of confusion about building referential, containment and other relationships into object-oriented distributed systems built according to the object invocation model. While real-time object request brokers (ORBs) have come into the marketplace, lagging behind is the craft of building distributed systems that can have predictable behavior while allowing large-scale object-to-object navigation. This paper advocates an architectural framework to be used in building large-scale relationship-rich distributed systems. The application of this architectural framework would be in systems where a large number of networked pieces of equipment are built into relational hierarchies.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116151801","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":"Applying a scalable CORBA event service to large-scale distributed interactive simulations","authors":"C. O'Ryan, D. Levine, D. Schmidt, J. Noseworthy","doi":"10.1109/WORDSF.1999.842335","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842335","url":null,"abstract":"Next-generation distributed interactive simulations (DISs) will have stringent quality of service (QoS) requirements for throughput, latency and scalability, as well as requirements for a flexible communication infrastructure to reduce software lifecycle costs. The CORBA event service provides a flexible model for asynchronous communication among distributed and collocated objects. However, the standard CORBA event service specification lacks important features and QoS optimizations required by DIS systems. This paper makes five contributions to the design, implementation and performance measurement of DIS systems. First, it describes how the CORBA event service can be implemented to support key QoS features. Second, it illustrates how to extend the CORBA event service so that it is better suited for DISs. Third, it describes how to develop efficient event dispatching and scheduling mechanisms that can sustain high throughput. Fourth, it describes how to use multicast protocols to reduce network traffic transparently and to improve system scalability. Finally, it illustrates how an event service framework can be strategized to support configurations that facilitate high throughput, predictable bounded latency, or some combination of each.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701717","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}
K. Kim, D. Beck, J. Q. Liu, H. Miyazaki, E. Shokri
{"title":"A CORBA service enabling programmer-friendly object-oriented real-time distributed computing","authors":"K. Kim, D. Beck, J. Q. Liu, H. Miyazaki, E. Shokri","doi":"10.1109/WORDSF.1999.842340","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842340","url":null,"abstract":"The TMO (time-triggered message-triggered object) structuring scheme has been established to remove the severe limitations of conventional object structuring techniques in developing real-time distributed computing (RTdC) applications. To facilitate the construction of TMO-structured RTdC applications consisting of CORBA-compliant TMO components, a middleware named TMO Execution Support (TMOES) has been created. TMOES itself is a CORBA object that can be supported by any ORB conforming to the standard specifications. Its instantiation must reside in every computing node involved in RTdC applications. This paper presents the architecture and an implementation model of TMOES.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132771453","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":"Process algebraic approach to the parametric analysis of object scheduling in real-time systems","authors":"Hee-Hwan Kwak, Insup Lee","doi":"10.1109/WORDSF.1999.842344","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842344","url":null,"abstract":"Describes an approach to the specification and analysis of scheduling problems of real-time systems. The method is based on ACSR-VP (Algebra of Communicating Shared Resources with Value Passing), which is an extension of ACSR, a real-time process algebra, with value-passing capabilities and parameterized processes. A scheduling problem is described in ACSR-VP terms with unknown parameters. H.-H. Kwak et al. (1998) performed the analysis based on the notion of bisimulation, and the outcome of the analysis was a set of predicate equations with free variables. In this paper, we introduce a new approach based on reachability analysis which produces a set of predicate equations with free variables from a specification modeled in ACSR-VP terms. Our approach produce smaller number of predicate equations than the approach based on symbolic weak bisimulation proposed by Kwak et al. The solution to predicate equations identifies under what values of the unknown parameters the system becomes schedulable. Finally, we present as an example a priority assignment problem with multiprocessors in an end-to-end system.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130495346","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":"Batching earliest deadline first scheduling","authors":"Maryam Moghaddas, B. Hamidzadeh","doi":"10.1109/WORDSF.1999.842329","DOIUrl":"https://doi.org/10.1109/WORDSF.1999.842329","url":null,"abstract":"Investigates the trade-off in the dynamic scheduling of real-time tasks, between the frequency at which the scheduling algorithm is invoked, the size of the task set to which the scheduling (prioritization) policy is applied at every invocation, and the quality of the resulting schedules in terms of deadline compliance. We identify two classes of algorithms, one of which forms a batch of arrived tasks and which schedules and executes all tasks in a batch before considering other tasks that arrive in the meantime. The other class accounts for and schedules arrived tasks more frequently and applies the scheduling policy to all available tasks. We compare the performance of a batching and a non-batching technique, both of which apply an earliest-deadline-first (EDF) policy to prioritize tasks. An experimental evaluation of the proposed algorithms shows that our batching algorithms outperform their non-batching counterparts under tighter time constraints.","PeriodicalId":416568,"journal":{"name":"Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129672840","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}