7 research outputs found

    Dynamic Assembly for System Adaptability, Dependability, and Assurance

    Get PDF
    (DASASA) ProjectAuthor-contributed print ite

    Initial CONNECT Architecture

    Get PDF
    Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computing environments. This challenge is exasperated by the highly heterogeneous technologies employed by each of the interacting parties, i.e., in terms of hardware, operating system, middleware protocols, and application protocols. The key aim of the CONNECT project is to drop this heterogeneity barrier and achieve universal interoperability. Here we report on the development of the overall CONNECT architecture that will underpin this solution; in this respect, we present the following contributions: i) an elicitation of interoperability requirements from a set of pervasive computing scenarios, ii) a survey of existing solutions to interoperability, iii) an initial view of the CONNECT architecture, and iv) a series of experiments to provide initial validation of the architecture

    How To Touch a Running System

    Get PDF
    The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity is conducted on an architecture level instead of directly in the code. This results in a separation of concerns; the appropriate reconfiguration can be devised on a coarse level, while the implementation of the components can remain largely unaware of reconfiguration scenarios. We study reconfiguration in component frameworks based on formal theory. We first discuss programming with components, exemplified with the development of the cmc model checker. This highly efficient model checker is made of C++ components and serves as an example for component-based software development practice in general, and also provides insights into the principles of adaptivity. However, the component model focuses on high performance and is not geared towards using the structuring principle of components for controlled reconfiguration. We thus complement this highly optimized model by a message passing-based component model which takes reconfigurability to be its central principle. Supporting reconfiguration in a framework is about alleviating the programmer from caring about the peculiarities as much as possible. We utilize the formal description of the component model to provide an algorithm for reconfiguration that retains as much flexibility as possible, while avoiding most problems that arise due to concurrency. This algorithm is embedded in a general four-stage adaptivity model inspired by physical control loops. The reconfiguration is devised to work with stateful components, retaining their data and unprocessed messages. Reconfiguration plans, which are provided with a formal semantics, form the input of the reconfiguration algorithm. We show that the algorithm achieves perceived atomicity of the reconfiguration process for an important class of plans, i.e., the whole process of reconfiguration is perceived as one atomic step, while minimizing the use of blocking of components. We illustrate the applicability of our approach to reconfiguration by providing several examples like fault-tolerance and automated resource control

    NASA Tech Briefs, April 1995

    Get PDF
    This issue of the NASA Tech Briefs has a special focus section on video and imaging, a feature on the NASA invention of the year, and a resource report on the Dryden Flight Research Center. The issue also contains articles on electronic components and circuits, electronic systems, physical sciences, materials, computer programs, mechanics, machinery, manufacturing/fabrication, mathematics and information sciences and life sciences. In addition to the standard articles in the NASA Tech brief, this contains a supplement entitled "Laser Tech Briefs" which features an article on the National Ignition Facility, and other articles on the use of Lasers

    An algorithmic approach to system architecting using shape grammar-cellular automata

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Engineering Systems Division, 2008.Includes bibliographical references (p. 404-417).This thesis expands upon the understanding of the fundamentals of system architecting in order to more effectively apply this process to engineering systems. The universal concern about the system architecting process is that the needs and wants of the stakeholders are not being fully satisfied, primarily because too few design alternatives are created and ambiguity exists in the information required. At the same time, it is noted that nature offers a superb example of system architecting and therefore should be considered as a guide for the engineering of systems. Key features of nature's architecting processes include self-generation, diversity, emergence, least action (balance of kinetic and potential energy), system-of-systems organization, and selection for stability. Currently, no human-friendly method appears to exist that addresses the problems in the field of system architecture while at the same time emulating nature's processes. By adapting nature's self-generative approach, a systematic means is offered to more rigorously conduct system architecting and better satisfy stakeholders. After reviewing generative design methods, an algorithmic methodology is developed to generate a space of architectural solutions satisfying a given specification, local constraints, and physical laws. This approach combines a visually oriented human design interface (shape grammar) that provides an intuitive design language with a machine (cellular automata) to execute the system architecture's production set (algorithm). The manual output of the flexible shape grammar, the set of design rules, is transcribed into cellular automata neighborhoods as a sequenced production set that may include other simple programs (such as combinatoric instructions).(cont.) The resulting catalog of system architectures can be unmanageably large, so selection criteria (e.g., stability, matching interfaces, least action) are defined by the architect to narrow the solution space for stakeholder review. The shape grammar-cellular automata algorithmic approach was demonstrated across several domains of study. This methodology improves on the design's clarification and the number of design alternatives produced, which should result in greater stakeholder satisfaction. Of additional significance, this approach has shown value both in the study of the system architecting process, leading to the proposal of normative principles for system architecture, and in the modeling of systems for better understanding.by Thomas H. Speller, Jr.Ph.D
    corecore