Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes in irregular topologies. During reconfiguration of a network based on virtual cut-through or wormhole switching, however, deadlocks in the transition phase between the old and the new routing function must be avoided. The avoidance of such deadlocks will in general ma...

This report surveys recent results and approaches from the field of control reconfiguration within a general fault-tolerant control framework. Open problems for future research are identified. Control reconfiguration is embedded within a wider fault-tolerant control context and set apart from other approaches to achieve fault tolerance. It is explained why simpler approaches than control reconf...

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 di...

This paper presents a new method to solve the network reconfiguration problem. The uncertainty of system loads on different feeders which vary from time to time makes the distribution system operation and its control more complex. For a fixed network configuration power loss is not minimum in a distributed network. Hence, there is a necessity for reconfiguration of the network. Network reconfig...

Reconfigurable computing is a paradigm in computing architecture that refers to the practice of using interchangeable hardware modules to enhance the performance of conventional Von-Neumann style computing. Despite the numerous advantages of reconfiguration, it is only suitable for quasi-static applications with slowly changing reconfiguration criteria. In general, it is only advantageous to re...

We present a complete, local, and parallel reconfiguration algorithm for metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being developed at PARC. We show that by using 2x2x2 meta-modules we can achieve completeness of reconfiguration space using only local rules. Furthermore, this reconfiguration can be done in place and massively in parallel with ma...

This thesis addresses the formal verification of a support infrastructure for resilient dynamically reconfigurable systems. A component-based system, whose architectural configuration may change at runtime, is classed as dynamically reconfigurable. Such systems require a support infrastructure for the control of reconfigurations to provide resilience. The verification of such reconfiguration su...

Ancient monolithic distributed systems were attached to well-known development practices and offline analysis. Current scenarios are more dynamic, and open, plenty of applications and services which appear and disappear dynamically at runtime. Likewise, these scenarios require taking into account actions that were traditionally addressed offline, this time in an online scenario. This paper cont...

The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers. It allows to reduce the communication overhead, improving the performance. In a previous paper [6], we presented a reconfiguration algorithm based on a cost function. It reconfigured the network in such a way that the original topology was preserved. However, that algorithm did not take int...