Our approach to dynamic configuration is based on building a model of reconfigurable applications. The model documents applications according to the configuration paradigm and for each component, captures structural constraints and behavioural information. The model presents change administrators with an abstract interface to dynamic configuration management. Change is initiated by submitting a version descriptor to the configuration manager; much of the low-level and error-prone activities of dynamic configuration are automated. Synchronisation of dynamic configuration with the application and management of persistent state are fundamental to preserving an application's integrity. We present our synchronisation mechanism, which adopts atomic operations for both intra- and inter-component computation. The problems of persistent state management are simplified by our synchronisation model. We also expose the difficulties and propose solutions for managing composite components and components whose operations are constrained.
{"title":"A model for dynamic configuration which preserves application integrity","authors":"I. Warren, I. Sommerville","doi":"10.1109/CDS.1996.509349","DOIUrl":"https://doi.org/10.1109/CDS.1996.509349","url":null,"abstract":"Our approach to dynamic configuration is based on building a model of reconfigurable applications. The model documents applications according to the configuration paradigm and for each component, captures structural constraints and behavioural information. The model presents change administrators with an abstract interface to dynamic configuration management. Change is initiated by submitting a version descriptor to the configuration manager; much of the low-level and error-prone activities of dynamic configuration are automated. Synchronisation of dynamic configuration with the application and management of persistent state are fundamental to preserving an application's integrity. We present our synchronisation mechanism, which adopts atomic operations for both intra- and inter-component computation. The problems of persistent state management are simplified by our synchronisation model. We also expose the difficulties and propose solutions for managing composite components and components whose operations are constrained.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125138439","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}
The paper addresses the problem of dynamic configuration management of highly available services. In particular, we are concerned with services that are provided by a group of actively replicated servers and are used by a large, rapidly changing set of clients. In this system model, we propose a replication management protocol to facilitate the dynamic configuration management of the server group, while maintaining service state consistency. We argue about the correctness of the protocol and report on initial implementation results.
{"title":"A replication protocol to support dynamically configurable groups of servers","authors":"C. Karamanolis, J. Magee","doi":"10.1109/CDS.1996.509358","DOIUrl":"https://doi.org/10.1109/CDS.1996.509358","url":null,"abstract":"The paper addresses the problem of dynamic configuration management of highly available services. In particular, we are concerned with services that are provided by a group of actively replicated servers and are used by a large, rapidly changing set of clients. In this system model, we propose a replication management protocol to facilitate the dynamic configuration management of the server group, while maintaining service state consistency. We argue about the correctness of the protocol and report on initial implementation results.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092588","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}
Complex distributed applications are often developed incrementally while they are in active use. Programming and runtime environments must allow software designers to make these changes easily and efficiently. This must be provided within the appropriate framework for modeling, analysis and correct execution that is essential for complex applications. The key to supporting reconfiguration of large-scale applications is providing efficient abstraction and composition mechanisms. By separating specification of well-defined components from the component interaction and composition behavior, we allow designers to implement easily replaceable components and changeable interaction behavior. The abstraction mechanism simplifies development of large-scale reconfigurable applications by hiding implementation details. The facility also includes automatic analytical tools for checking consistency, reachability and dependency in the behavior of interacting components. These tools are essential for development and runtime support of large-scale and reconfigurable decentralized applications.
{"title":"Abstraction and composition techniques for reconfiguration of large-scale complex applications","authors":"A. Lim","doi":"10.1109/CDS.1996.509361","DOIUrl":"https://doi.org/10.1109/CDS.1996.509361","url":null,"abstract":"Complex distributed applications are often developed incrementally while they are in active use. Programming and runtime environments must allow software designers to make these changes easily and efficiently. This must be provided within the appropriate framework for modeling, analysis and correct execution that is essential for complex applications. The key to supporting reconfiguration of large-scale applications is providing efficient abstraction and composition mechanisms. By separating specification of well-defined components from the component interaction and composition behavior, we allow designers to implement easily replaceable components and changeable interaction behavior. The abstraction mechanism simplifies development of large-scale reconfigurable applications by hiding implementation details. The facility also includes automatic analytical tools for checking consistency, reachability and dependency in the behavior of interacting components. These tools are essential for development and runtime support of large-scale and reconfigurable decentralized applications.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114458250","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}
Our past research with configurable operating system abstractions has developed a model and implementation of adaptive multiprocessor operating systems for improved application performance. Adaptive locks are one such kernel component where lock adaptations are performed for each application program to suit its dynamic locking pattern. The paper compares and evaluates two different methods for performing such runtime adaptation: synchronous adaptations performed in conjunction with program accesses to the abstractions being configured and asynchronous adaptations performed concurrently with the program's execution. Asynchronous and synchronous adaptation schemes are evaluated experimentally using adaptive locks for several multiprocessor applications on a KSR-2 supercomputer. Experiments establish that the attainment of performance gains by use of dynamic adaptation requires the use of both schemes, each suitable for different classes of application programs.
{"title":"Evaluation of the adaptation techniques in Kernel Tool Kit (KTK)","authors":"B. Mukherjee, K. Schwan","doi":"10.1109/CDS.1996.509366","DOIUrl":"https://doi.org/10.1109/CDS.1996.509366","url":null,"abstract":"Our past research with configurable operating system abstractions has developed a model and implementation of adaptive multiprocessor operating systems for improved application performance. Adaptive locks are one such kernel component where lock adaptations are performed for each application program to suit its dynamic locking pattern. The paper compares and evaluates two different methods for performing such runtime adaptation: synchronous adaptations performed in conjunction with program accesses to the abstractions being configured and asynchronous adaptations performed concurrently with the program's execution. Asynchronous and synchronous adaptation schemes are evaluated experimentally using adaptive locks for several multiprocessor applications on a KSR-2 supercomputer. Experiments establish that the attainment of performance gains by use of dynamic adaptation requires the use of both schemes, each suitable for different classes of application programs.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132753213","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}
This paper describes a family of design patterns that enhance the flexibility and extensibility of communication software by permitting network services to evolve independently of the strategies used to passively initialize the services. The paper makes three contributions to the study and development of configurable distributed systems. First, it identifies five orthogonal dimensions of passive service initialization: service advertisement, endpoint listening, service handler creation, passive connection establishment, and service handler activation. Second the paper illustrates how a family of design patterns have been used to build a communication software framework that supports flexible configuration of different strategies for each of these five dimensions. Third, the paper demonstrates how design patterns and frameworks are being used successfully to develop configurable large-scale production distributed systems.
{"title":"A family of design patterns for flexibly configuring network services in distributed systems","authors":"D. Schmidt","doi":"10.1109/CDS.1996.509354","DOIUrl":"https://doi.org/10.1109/CDS.1996.509354","url":null,"abstract":"This paper describes a family of design patterns that enhance the flexibility and extensibility of communication software by permitting network services to evolve independently of the strategies used to passively initialize the services. The paper makes three contributions to the study and development of configurable distributed systems. First, it identifies five orthogonal dimensions of passive service initialization: service advertisement, endpoint listening, service handler creation, passive connection establishment, and service handler activation. Second the paper illustrates how a family of design patterns have been used to build a communication software framework that supports flexible configuration of different strategies for each of these five dimensions. Third, the paper demonstrates how design patterns and frameworks are being used successfully to develop configurable large-scale production distributed systems.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002103","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}
The paper presents the architecture and base services of Sampa, a System for Availability Management of Process-based Applications. The system has been designed to support the management of fault-tolerant DCE-based distributed programs according to user provided and application-specific availability specifications. Sampa is supposed to detect and automatically react to faults such as node crashes, network partitions, process crashes and hang-ups. We focus on the design of its base services-the monitoring, reliable group communication and checkpointing facilities and show how they can be used for managing a generic replicated service.
{"title":"Supporting distributed application management in Sampa","authors":"M. Endler, Anil J. D'Souza","doi":"10.1109/CDS.1996.509360","DOIUrl":"https://doi.org/10.1109/CDS.1996.509360","url":null,"abstract":"The paper presents the architecture and base services of Sampa, a System for Availability Management of Process-based Applications. The system has been designed to support the management of fault-tolerant DCE-based distributed programs according to user provided and application-specific availability specifications. Sampa is supposed to detect and automatically react to faults such as node crashes, network partitions, process crashes and hang-ups. We focus on the design of its base services-the monitoring, reliable group communication and checkpointing facilities and show how they can be used for managing a generic replicated service.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115767364","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}
N. Minsky, V. Ungureanu, Junbiao Zhang, Wenhui Wang
Given a certain class C of reconfigurations, deemed to be potentially important for a given system, we define a reconfiguration suite S/sub c/ to be a set of primitive operations that satisfy the following conditions: any reconfiguration in C can be carried out by a sequence of primitives from S/sub c/. The correctness of S/sub c/ should be independent of the functionality of the system, and invariant of its reconfigurations (for a given set of possible configurations of the system at hand). We describe a mechanism for implementing such reconfiguration suites, for a system that operates under law-governed interaction (LGI), currently supported by an experimental toolkit called Moses. LGI is a mode of interaction between the members of a given group (or system) of agents, which is governed by an explicit and strictly enforced set of rules, called the law of this group. The existence of such a law under LGI provides us with an architectural model of the system, which can be made to include the definition of reconfiguration suites.
给定一个重构类C，被认为对给定系统具有潜在的重要性，我们定义一个重构套件S/sub C /为满足以下条件的一组原语操作:C中的任何重构都可以由S/sub C /中的一系列原语来完成。S/sub / c/的正确性应该独立于系统的功能，并且它的重新配置是不变的(对于给定的一组可能的系统配置)。我们描述了一种实现这种重构套件的机制，该机制适用于在受法律约束的交互(LGI)下运行的系统，目前由一个名为Moses的实验性工具包支持。LGI是给定代理组(或系统)成员之间的一种交互模式，它由一组明确且严格执行的规则(称为该组的法律)管理。在LGI下存在这样的法律为我们提供了系统的体系结构模型，该模型可以包含重新配置套件的定义。
{"title":"Building reconfiguration primitives into the law of a system","authors":"N. Minsky, V. Ungureanu, Junbiao Zhang, Wenhui Wang","doi":"10.1109/CDS.1996.509350","DOIUrl":"https://doi.org/10.1109/CDS.1996.509350","url":null,"abstract":"Given a certain class C of reconfigurations, deemed to be potentially important for a given system, we define a reconfiguration suite S/sub c/ to be a set of primitive operations that satisfy the following conditions: any reconfiguration in C can be carried out by a sequence of primitives from S/sub c/. The correctness of S/sub c/ should be independent of the functionality of the system, and invariant of its reconfigurations (for a given set of possible configurations of the system at hand). We describe a mechanism for implementing such reconfiguration suites, for a system that operates under law-governed interaction (LGI), currently supported by an experimental toolkit called Moses. LGI is a mode of interaction between the members of a given group (or system) of agents, which is governed by an explicit and strictly enforced set of rules, called the law of this group. The existence of such a law under LGI provides us with an architectural model of the system, which can be made to include the definition of reconfiguration suites.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348621","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}
In distributed systems, object replication is used to improve the availability and performance of applications in the presence of failures. When determining the configuration of a replicated object (i.e., number and location of replicas), a number of often conflicting factors need to be considered, e.g., the availability and performance requirements of the object. However, application specific knowledge about the objects, such as any inter-dependencies, is typically not accounted for. In many applications this information can effect an object's availability. Distributed systems which support replication typically give users only basic control over the configuration of a replicated object, such as the number or location of individual replicas. Expressing application specific knowledge is not possible. We have designed and implemented a replication sub-system allowing applications to control these aspects of replication. This system allows the efficient replication of an arbitrary number of objects with arbitrary inter-dependencies.
{"title":"Using application specific knowledge for configuring object replicas","authors":"M. Little, S. Shrivastava","doi":"10.1109/CDS.1996.509359","DOIUrl":"https://doi.org/10.1109/CDS.1996.509359","url":null,"abstract":"In distributed systems, object replication is used to improve the availability and performance of applications in the presence of failures. When determining the configuration of a replicated object (i.e., number and location of replicas), a number of often conflicting factors need to be considered, e.g., the availability and performance requirements of the object. However, application specific knowledge about the objects, such as any inter-dependencies, is typically not accounted for. In many applications this information can effect an object's availability. Distributed systems which support replication typically give users only basic control over the configuration of a replicated object, such as the number or location of individual replicas. Expressing application specific knowledge is not possible. We have designed and implemented a replication sub-system allowing applications to control these aspects of replication. This system allows the efficient replication of an arbitrary number of objects with arbitrary inter-dependencies.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125634150","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
扫码关注我们
求助内容：
应助结果提醒方式：