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

A reconfiguration technique using a switched-capacitor (SC)-based voltage equalizer differential power processing (DPP) concept is proposed in this paper for photovoltaic (PV) systems at cell/subpanel/panel-level. The active diffusion charge redistribution (ADCR) architecture increases the energy yield during mismatch and adds boosting capability to PV system under no by connected available cel...

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

This paper describes a case study involving the dynamic reconfiguration of an office workflow. We state the requirements on a system implementing the workflow and its reconfiguration, and describe the system’s design in BPMN. We then use an asynchronous π-calculus and Webπ∞ to model the design and to verify whether or not it will meet the requirements. In the process, we evaluate the formalisms...

The feasibility of run-time reconfiguration of FPGAs has been established by a large number of case studies. However, these systems have typically involved an ad hoc combination of hardware and software. The software that manages the dynamic reconfiguration is typically specialised to one application and one hardware configuration. We present three different applications of dynamic reconfigurat...

We present a simple model for specifying and optimising designs which contain elements that can be reconfigured at run-time. In this model the control mechanism for reconfiguration can be implemented in many ways: by the user using multiplexers or other logic blocks, or by FPGAs which support dynamic partial reconfiguration. The model can be used for encoding layout information and for assessin...