Design and analysis of reconfigurable VLSVWSI array architectures is an increasingly complicated task, especially in evaluating the impact of reconfiguration mechanisms on performance, overhead, and yield. In this paper, we present an integrated computer-aided design environment, the VAR (VHDLbased Array Reconfiguration) system, for the tasks of design, diagnosis, reconfiguration, simulation, a...

The fast growing VLSI industry demands new techniques for configuring the FPGA. When it comes to defence and space application the configuration of the FPGA becomes more crucial. When it is required to configure the FPGA automatically, the need arises of more sophisticated and fast techniques for reconfiguration of FPGA. In the space application, the effect of radiation changes the bit patterns...

In this paper, a robust reconfiguration approach based on Mixed Integer Programming (MIP) is proposed to minimize loss in distribution systems. A Depth-First Search (DFS) algorithm to enumerate possible loops provides radiality constraint. This provides a general solution to the radiality constraint for distribution system reconfiguration/expansion problems. Still, imprecision and ambiguity in ...

In this paper, a lightweight autonomous reconfiguration approach is developed for Field Programmable Gate Arrays (FPGAs). Under the Multilayer Runtime Reconfiguration Architecture (MRRA) paradigm, hardware configuration information is read and operated on directly at runtime to provide low overhead dynamic reconfiguration. This enables a standardized set of Application Programming Interfaces (A...

Component & connector architecture description languages (C&C ADLs) provide hierarchical decomposition of system functionality into components and their interaction. Most ADLs fix interaction configurations at design time while some express dynamic reconfiguration of components to adapt to runtime changes. Implementing dynamic reconfiguration in a static C&C ADL by encoding it into component be...

In this paper we present how to reconfigure dynamically a complete binary tree in faulty hypercubes. First, we use a dynamic algorithm to reconfigure a complete binary tree of height h (h≥0) in an (h+1)-dimensional faulty hypercube. If there is a faulty node in the hypercube, both the dilation and congestion are 2 after reconfiguration. If there are two faulty nodes in the hypercube, both the d...

Reconfiguration allows a self-reconfiguring modular robot to adapt to its environment. The reconfiguration planning problem is one of the key algorithmic challenges in realizing self-reconfiguration. Many existing successful approaches rely on grouping modules together to act as meta-modules. However, we are interested in reconfiguration planning that does not impose fixed meta-module relations...

We propose the redistribution-reconfiguration~(red-rec) algorithm to efficiently compute control protocols assemble compact-centered configurations of atoms in two-dimensional arrays optical traps with lattice geometries. The red-rec redistributes among pairs donor-receiver columns and reconfigures each column using an exact displacement-minimizing algorithm, harnessing parallel operations that...

In recent years, in Iran and other countries the power systems are going to move toward creating a competition structure for selling and buying electrical energy. These changes and the numerous advantages of DGs have made more incentives to use these kinds of generators than before. Therefore, it is necessary to study all aspects of DGs, such as size selection and optimal placement and impact o...