Traditional configurable operating systems typically provide a fixed and limited set of functionality. We propose a metalevel architecture, where application-defined objects can choose from a rich selection of possible configurations and are therefore able to dynamically change the way in which they are executed to the configuration that suits best. This allows applications to adapt operating system behaviour to even unanticipated requirements during run-time. A distributed application which processes multimedia data serves as an example to illustrate the concepts described.
{"title":"It's your choice-on the design and implementation of a flexible metalevel architecture","authors":"C. Zimmermann, V. Cahill","doi":"10.1109/CDS.1996.509353","DOIUrl":"https://doi.org/10.1109/CDS.1996.509353","url":null,"abstract":"Traditional configurable operating systems typically provide a fixed and limited set of functionality. We propose a metalevel architecture, where application-defined objects can choose from a rich selection of possible configurations and are therefore able to dynamically change the way in which they are executed to the configuration that suits best. This allows applications to adapt operating system behaviour to even unanticipated requirements during run-time. A distributed application which processes multimedia data serves as an example to illustrate the concepts described.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"47 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120857290","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}
Event services are needed for control systems, implementing management of networks and distributed and event based applications. In all these applications it is necessary to filter out unwanted events and combine low-level event sequences into a higher level, more abstract event to trigger an action. In this paper we present a flexible and powerful distributed event service which can be used to process and disseminate events for many different applications. The service can be configured dynamically at two levels. Composite events can be defined as rules in terms of event sequences using the GEM notation. These rules can be loaded, removed, enabled and disabled dynamically within event monitoring interpreters. Interpreters and event disseminator components can then be dynamically configured onto physical nodes within the system using the Darwin configuration environment to distribute the monitoring close to where events are generated. This reduces network traffic caused by event generation in large systems.
{"title":"A configurable event service for distributed systems","authors":"M. Mansouri-Samani, M. Sloman","doi":"10.1109/CDS.1996.509364","DOIUrl":"https://doi.org/10.1109/CDS.1996.509364","url":null,"abstract":"Event services are needed for control systems, implementing management of networks and distributed and event based applications. In all these applications it is necessary to filter out unwanted events and combine low-level event sequences into a higher level, more abstract event to trigger an action. In this paper we present a flexible and powerful distributed event service which can be used to process and disseminate events for many different applications. The service can be configured dynamically at two levels. Composite events can be defined as rules in terms of event sequences using the GEM notation. These rules can be loaded, removed, enabled and disabled dynamically within event monitoring interpreters. Interpreters and event disseminator components can then be dynamically configured onto physical nodes within the system using the Darwin configuration environment to distribute the monitoring close to where events are generated. This reduces network traffic caused by event generation in large systems.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"158 10 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":"128958298","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}
With the increasing demand for long running and highly available distributed services, interest in systems which can undergo dynamic reconfiguration has risen. However for dynamic change to yield valid systems, change actions must be carried out such that the consistency of the software modules making up the system is not breached. This can be ensured if the subset of the system which is to undergo change is in a state amenable to reconfiguration. This paper presents an algorithm which imposes a safe state over the part of the system undergoing change. The algorithm suits a particular class of transactional systems and places special emphasis on minimising the interference to the rest of the system and reducing the programmer contribution necessary for achieving this safe state.
{"title":"Maintaining node consistency in the face of dynamic change","authors":"K. Moazami-Goudarzi, J. Kramer","doi":"10.1109/CDS.1996.509347","DOIUrl":"https://doi.org/10.1109/CDS.1996.509347","url":null,"abstract":"With the increasing demand for long running and highly available distributed services, interest in systems which can undergo dynamic reconfiguration has risen. However for dynamic change to yield valid systems, change actions must be carried out such that the consistency of the software modules making up the system is not breached. This can be ensured if the subset of the system which is to undergo change is in a state amenable to reconfiguration. This paper presents an algorithm which imposes a safe state over the part of the system undergoing change. The algorithm suits a particular class of transactional systems and places special emphasis on minimising the interference to the rest of the system and reducing the programmer contribution necessary for achieving this safe state.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"216 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":"124256404","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}
Configuration programming is the process whereby components written in any conventional programming language can be bound together to form a dynamic system, often suitable for execution on distributed hardware. Among the specialised languages that exist for configuration programming there is currently a debate over the importance of recognising the connections between components as being as important as the components themselves. The paper lays out the pros and cons of the debate, outlining in the process the properties and roles of connectors. By means of experiments we show how connectors influence the way configurations are programmed and also how some of the effects can be simulated. The examples are given in Darwin, UNICON and WRIGHT and reference is also made to the status of other current configuration languages.
{"title":"Connectors in configuration programming languages: are they necessary?","authors":"J. Bishop, Roberto Faria","doi":"10.1109/CDS.1996.509341","DOIUrl":"https://doi.org/10.1109/CDS.1996.509341","url":null,"abstract":"Configuration programming is the process whereby components written in any conventional programming language can be bound together to form a dynamic system, often suitable for execution on distributed hardware. Among the specialised languages that exist for configuration programming there is currently a debate over the importance of recognising the connections between components as being as important as the components themselves. The paper lays out the pros and cons of the debate, outlining in the process the properties and roles of connectors. By means of experiments we show how connectors influence the way configurations are programmed and also how some of the effects can be simulated. The examples are given in Darwin, UNICON and WRIGHT and reference is also made to the status of other current configuration languages.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"1 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":"128738207","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}
A framework for supporting adaptive execution of parallel applications on networks of workstations is presented. The framework is comprised of two levels of competition. At the first level, the tasks of each application are partitioned into grains. The grains race one another until all their tasks are finished. The turn-around time of an application can be shortened by sharing the tasks of the heavily loaded grains with the neighboring grains. At the second level, a prototype system called Comedians has been developed, which enables competition among applications for workstations by mechanisms of auction and bidding. The objectives of the Comedians system are to maximize the speedup of individual parallel applications and, at the same time, to allocate workstations efficiently and fairly to the applications. Unlike related work, the paper suggests an integrated solution to both the issues of adaptive parallelism and parallel application scheduling in a multi-user environment. The experimental results demonstrate the effectiveness of the support for adaptive parallelism and the dynamics of competition among parallel applications.
{"title":"Adaptive distributed computing through competition","authors":"Kam Hong Shum","doi":"10.1109/CDS.1996.509365","DOIUrl":"https://doi.org/10.1109/CDS.1996.509365","url":null,"abstract":"A framework for supporting adaptive execution of parallel applications on networks of workstations is presented. The framework is comprised of two levels of competition. At the first level, the tasks of each application are partitioned into grains. The grains race one another until all their tasks are finished. The turn-around time of an application can be shortened by sharing the tasks of the heavily loaded grains with the neighboring grains. At the second level, a prototype system called Comedians has been developed, which enables competition among applications for workstations by mechanisms of auction and bidding. The objectives of the Comedians system are to maximize the speedup of individual parallel applications and, at the same time, to allocate workstations efficiently and fairly to the applications. Unlike related work, the paper suggests an integrated solution to both the issues of adaptive parallelism and parallel application scheduling in a multi-user environment. The experimental results demonstrate the effectiveness of the support for adaptive parallelism and the dynamics of competition among parallel applications.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"48 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":"130927175","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}
M. Capps, P. D. Stotts, James W. Duff, James M. Purtilo
The paper exhibits the use of existing software bus technology in interconnecting virtual-reality environment (VE) software. Interoperability and application construction from heterogeneous modules are well-explored topics of distributed systems. A joint project using the Polylith software bus from the University of Maryland and VE software from the UNC graphics lab has shown the utility of composing existing applications as opposed to making extensive individual modifications. The paper claims only a unique application of these methods to a new client area. Multi-user VE walkthroughs (software navigators) are an exciting new area in graphics software but we see that with the rapid development of graphics technology, next-generation applications (including multiuser systems) are commonly redesigned from the ground up. Here we see an excellent opportunity to examine module reusability, with proven software, in a new application area. We hope our experiments will likely lead to conclusions about VE programming abstractions and produce development methods for making easily interoperable next-generation VE applications.
{"title":"Distributed interoperable virtual environments","authors":"M. Capps, P. D. Stotts, James W. Duff, James M. Purtilo","doi":"10.1109/CDS.1996.509363","DOIUrl":"https://doi.org/10.1109/CDS.1996.509363","url":null,"abstract":"The paper exhibits the use of existing software bus technology in interconnecting virtual-reality environment (VE) software. Interoperability and application construction from heterogeneous modules are well-explored topics of distributed systems. A joint project using the Polylith software bus from the University of Maryland and VE software from the UNC graphics lab has shown the utility of composing existing applications as opposed to making extensive individual modifications. The paper claims only a unique application of these methods to a new client area. Multi-user VE walkthroughs (software navigators) are an exciting new area in graphics software but we see that with the rapid development of graphics technology, next-generation applications (including multiuser systems) are commonly redesigned from the ground up. Here we see an excellent opportunity to examine module reusability, with proven software, in a new application area. We hope our experiments will likely lead to conclusions about VE programming abstractions and produce development methods for making easily interoperable next-generation VE 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":"117111263","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 introduces the Aster distributed composition-based programming system that is aimed at easing the development of distributed runtime systems, customized to the application needs, in a CORBA-based environment. Our approach is based on high-level customization: given the specification of application requirements using the Aster composition language, a distributed runtime system, customized for meeting these requirements is built. Furthermore, the fact that the Aster system is based on the CORBA standard for distributed computing enhances the potential of re-use of both application-level and system-level software.
{"title":"Aster: a CORBA-based software interconnection system supporting distributed system customization","authors":"V. Issarny, C. Bidan","doi":"10.1109/CDS.1996.509362","DOIUrl":"https://doi.org/10.1109/CDS.1996.509362","url":null,"abstract":"The paper introduces the Aster distributed composition-based programming system that is aimed at easing the development of distributed runtime systems, customized to the application needs, in a CORBA-based environment. Our approach is based on high-level customization: given the specification of application requirements using the Aster composition language, a distributed runtime system, customized for meeting these requirements is built. Furthermore, the fact that the Aster system is based on the CORBA standard for distributed computing enhances the potential of re-use of both application-level and system-level software.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"1 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":"130080791","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}
Kea is a new operating system kernel which has been designed for maximum flexibility and performance in the areas of kernel and application extensibility and dynamic reconfiguration. Kea provides a means through which kernel services can be reconfigured, either on an application specific or system wide scale. We describe the design and implementation of these features, and report on some of our current research which relies on these abilities.
{"title":"Kea-a dynamically extensible and configurable operating system kernel","authors":"Alistair C. Veitch, N. Hutchinson","doi":"10.1109/CDS.1996.509367","DOIUrl":"https://doi.org/10.1109/CDS.1996.509367","url":null,"abstract":"Kea is a new operating system kernel which has been designed for maximum flexibility and performance in the areas of kernel and application extensibility and dynamic reconfiguration. Kea provides a means through which kernel services can be reconfigured, either on an application specific or system wide scale. We describe the design and implementation of these features, and report on some of our current research which relies on these abilities.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"79 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":"116885878","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ürgen Berghoff, O. Drobnik, Anselm Lingnau, Christian Mönch
Mobile agents provide a new paradigm for distributed computation. Their unique properties appear well suited to the configuration management of large and complex distributed applications. After outlining our concept of configuration management, we describe a basic agent infrastructure and its extensions for configuration management of distributed applications. Then we consider aspects of concurrent agents and discuss the advantages of the agent based approach through an example.
{"title":"Agent-based configuration management of distributed applications","authors":"Jürgen Berghoff, O. Drobnik, Anselm Lingnau, Christian Mönch","doi":"10.1109/CDS.1996.509346","DOIUrl":"https://doi.org/10.1109/CDS.1996.509346","url":null,"abstract":"Mobile agents provide a new paradigm for distributed computation. Their unique properties appear well suited to the configuration management of large and complex distributed applications. After outlining our concept of configuration management, we describe a basic agent infrastructure and its extensions for configuration management of distributed applications. Then we consider aspects of concurrent agents and discuss the advantages of the agent based approach through an example.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"134 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":"116353435","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}
Data handles and virtual connections are presented as a solution to the problem of supporting application-driven reconfiguration without sacrificing the separation of communication and computation. The solution supports anonymous reconfiguration, meaning that the module performing the reconfiguration and the modules affected by the reconfiguration need not be aware of each other's presence in the system. The solution allows modules to reconfigure the system within the limits of a specified communication structure while retaining support for dynamic end-user reconfiguration. The work is presented in the context of I/O abstraction, a programming model that defines the communication structure of a distributed system in terms of connections among narrow data interfaces of encapsulated modules. I/O abstraction supports dynamic end-user reconfiguration of distributed applications by separating the communication structure from the module definitions.
{"title":"Data handles and virtual connections: high-level support for anonymous reconfiguration","authors":"B. Swaminathan, K. Goldman","doi":"10.1109/CDS.1996.509342","DOIUrl":"https://doi.org/10.1109/CDS.1996.509342","url":null,"abstract":"Data handles and virtual connections are presented as a solution to the problem of supporting application-driven reconfiguration without sacrificing the separation of communication and computation. The solution supports anonymous reconfiguration, meaning that the module performing the reconfiguration and the modules affected by the reconfiguration need not be aware of each other's presence in the system. The solution allows modules to reconfigure the system within the limits of a specified communication structure while retaining support for dynamic end-user reconfiguration. The work is presented in the context of I/O abstraction, a programming model that defines the communication structure of a distributed system in terms of connections among narrow data interfaces of encapsulated modules. I/O abstraction supports dynamic end-user reconfiguration of distributed applications by separating the communication structure from the module definitions.","PeriodicalId":302050,"journal":{"name":"Proceedings of International Conference on Configurable Distributed Systems","volume":"21 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":"116287680","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
扫码关注我们
求助内容：
应助结果提醒方式：