5,687 Hits in 4.7 sec

The survivability of design-specific spare placement in FPGA architectures with high defect rates

Amit Agarwal, Jason Cong, Brian Tagiku
2013 ACM Transactions on Design Automation of Electronic Systems  
The survivability of design-specific spare placement in FPGA architectures with high defect rates.  ...  Then, we propose a placement algorithm which, in the presence of randomly generated faults, optimizes spare placement to maximize the probability that the FPGA can be reconfigured to meet a specified timing  ...  If node D fails, the first placement does not have any spares in the same CLB to cover the fault and must assign D to one of two spare BLEs in the other CLB.  ... 
doi:10.1145/2442087.2442104 fatcat:p36tippmdbbzlpxq4zwevhy554

Fault tolerant placement and defect reconfiguration for nano-FPGAs

Amit Agarwal, Jason Cong, Brian Tagiku
2008 2008 IEEE/ACM International Conference on Computer-Aided Design  
defect reconfiguration through replacement of defective logic elements with spares.  ...  In addition, our study of the fault reconfiguration problem shows it is NP-Complete, and we propose a fast scheme for achieving a good reconfiguration solution for a random or clustered fault map.  ...  Theorem 1: The Failure Assignment problem is NP-complete (in the strong sense) when the cluster capacity is a fixed constant c ≥ 4.  ... 
doi:10.1109/iccad.2008.4681655 dblp:conf/iccad/AgarwalCT08 fatcat:6g3tvnho6bckpjgqzxm7z4ihwm

Physical-Layer p-Cycles Adapted for Router-Level Node Protection: A Multi-Layer Design and Operation Strategy

John Doucette, Wayne Grover, Peter Giese
2007 IEEE Journal on Selected Areas in Communications  
In test cases it was found that the spare capacity provided by span-protecting p-cycles can provide a high level of node protection depending on the strategy used for exploting the p-cycle capacity.  ...  We study an idea for efficient integrated protection of an IP over WDM network using the spare capacity of spanprotecting p-cycles to provide protection against both optical link failures and router node  ...  of spare capacity placed on span k in that design.  ... 
doi:10.1109/jsac.2007.070609 fatcat:nkjfcux3ave53b2bt3d77gzuje

Spare Capacity Reprovisioning for Shared Backup Path Protection in Dynamic Generalized Multi-Protocol Label Switched Networks

Pin-Han Ho, J. Tapolcai, A. Haque
2008 IEEE Transactions on Reliability  
In this paper, an availability-aware spare capacity reconfiguration scheme based on shared backup path protection (SBPP) is proposed, aiming to guarantee the endto-end (E2E) availability of each Label  ...  Spare capacity allocation serves as one of the most critical tasks in dynamic Generalized Multi-Protocol Label Switching (GMPLS) networks to meet the stringent network availability constraint stipulated  ...  SIMULATION Simulation is conducted to (1) validate the proposed availability Model, and (2) verify the effectiveness of the spare capacity reconfiguration strategy in terms of the spare capacity saving  ... 
doi:10.1109/tr.2008.2006037 fatcat:rrpo4kbn2fbhzer4x6mur2fxfa

Efficient algorithms for reconfiguration in VLSI/WSI arrays

V.P. Roychowdhury, J. Bruck, T. Kailath
1990 IEEE transactions on computers  
In view of the above results, the contributions of this paper with regard to the single-track models can be summarized as follows. .We show that the conditions in the reconfigurability theorem are not  ...  of the so-called reconfigurability theorem (for a formal proof, see Reconfigurability Theorem: Given an m x n array of nonspare PE's, with spare PE's along the sides, it is reconfigurable into an m x  ...  the IEEE Information Theory Group in 1975 He I$ a Fellow of the Institute of Mathematical Statistics and is a member of the Nationdl Academy of Engineering  ... 
doi:10.1109/12.54841 fatcat:eiqixf43znfwzmifdyjykd5a4q

Implications of Reliability Enhancement Achieved by Fault Avoidance on Dynamically Reconfigurable Architectures

Hiroaki Konoura, Yukio Mitsuyama, Masanori Hashimoto, Takao Onoye
2011 2011 21st International Conference on Field Programmable Logic and Applications  
Experimental results reveal 1) MTTF is highly correlated with the number of avoided faults, 2) there is the efficiency difference of spare usage in five fault avoidance methods, and 3) spares should be  ...  Fault avoidance methods on dynamically reconfigurable devices have been proposed to extend device life-time, while their quantitative comparison has not been sufficiently presented.  ...  ACKNOWLEDGEMENT The authors would like to thank the project members of JST CREST of Kyoto University, Kyoto Institute of Technology, Nara Institute of Science and Technology, and ASTEM RI for their discussions  ... 
doi:10.1109/fpl.2011.108 dblp:conf/fpl/KonouraMHO11 fatcat:jaq4bi5wajh5nl66ijd6zlwjie

Multi-mode energy management for multi-tier server clusters

Tibor Horvath, Kevin Skadron
2008 Proceedings of the 17th international conference on Parallel architectures and compilation techniques - PACT '08  
Moreover, we rigorously investigate selection of the optimal number of spare servers for each power state, a problem that has only been approached in an ad-hoc manner in current policies.  ...  This paper presents an energy management policy for reconfigurable clusters running a multi-tier application, exploiting DVS together with multiple sleep states.  ...  CONCLUSIONS Energy management for reconfigurable clusters can be separated into two independent concerns: the management of active and spare capacity.  ... 
doi:10.1145/1454115.1454153 dblp:conf/IEEEpact/HorvathS08 fatcat:rln7qhojsnhhnmpa5lw4hpn2xq

Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks

Shu Huang, Rudra Dutta
2006 2006 3rd International Conference on Broadband Communications, Networks and Systems  
In this paper, we propose an over-provisioning scheme, which pre-allocates the spare capacity of lightpaths to dynamic subwavelength traffic demands such that the network can be more agile in responding  ...  The traffic grooming problem in optical networks is an optimization problem of aggregating sub-wavelength traffic demands onto lightpaths such that the required electronic switching capability, hence network  ...  Thus, a covered x i results in an assignment of p i + 1 unit of spare capacity, and an uncovered x i results in an assignment of p i unit of spare capacity.  ... 
doi:10.1109/broadnets.2006.4374369 dblp:conf/broadnets/HuangD06 fatcat:y62lryf6mneoxekck75jzbnezy

Automated Safety & Security Systems for Industrial Application using Self-Healing Approach

B Sri SaiCharan
2021 International Journal for Research in Applied Science and Engineering Technology  
The concept of self-healing for hardware systems is studied in this study, and a new approach is offered.  ...  This research proposes a new method for self-healing based on embryonic hardware that does not require the use of spare cells.  ...  Like multi-cell life forms in nature the design of circuits in view of EmHW is two-dimensional exhibit of electronic cells (e-cell) with equipment reconfiguration capacity. 2667 ©IJRASET: All Rights  ... 
doi:10.22214/ijraset.2021.35640 fatcat:l5yhubrawjd2nbf67buvftmwri

The cost of reconfiguration in a cloud

Akshat Verma, Gautam Kumar, Ricardo Koller
2010 Proceedings of the 11th International Middleware Conference Industrial track on - Middleware Industrial Track '10  
In this paper, we study the cost of reconfiguring a cloud-based IT infrastructure in response to workload variations.  ...  If spare CPU is not available, it impacts both the duration of migration and the performance of the application being migrated.  ...  Contribution In this work, we address the following questions: (i) What are the important factors that determine the cost of reconfiguration? (i) How can we reduce the impact of reconfiguration?  ... 
doi:10.1145/1891719.1891721 dblp:conf/middleware/VermaKK10 fatcat:bzkv6x5iqvdwvagkd7cvsgkz7q

A Motif-based Mission Planning Method for UAV Swarms Considering Dynamic Reconfiguration

Jiajie Liu, Weiping Wang, Xiaobo Li, Tao Wang, Tongqing Wang
2018 Defence Science Journal  
In light of this situation, mission planning for UAV swarms under limited communication has become a difficult problem.  ...  This paper introduces motifs as the basic unit of configuration and proposes a motif-based mission planning method considering dynamic reconfiguration.  ...  In Step 2, spare UAVs are selected (UAVs are spare when they are not in working condition). If spare UAVs can constitute motifs that task completion require at that moment, the task can start.  ... 
doi:10.14429/dsj.68.11959 fatcat:lr2yvatft5dzhgqq2xi4okbmpm

Benefits of Link Protection at Connection Granularity

Karthikeyan Sathyamurthy, Srinivasan Ramasubramanian
2006 Photonic network communications  
As a connection is routed only around a failed link, the channel assignment for the connection on the backup path of the failed link must be consistent with that of the primary path.  ...  Such a consistency is guaranteed at the time of call admission.  ...  If the switch at node C was pre-configured to switch spare fiber of link 3 to link 5, then it has to be reconfigured after link 1 fails.  ... 
doi:10.1007/s11107-005-6022-z fatcat:id6sock4xrh5xpl3a7smx4agdq

Optimal reconfiguration of satellite constellations with the auction algorithm

Olivier L. de Weck, Uriel Scialom, Afreen Siddiqi
2008 Acta Astronautica  
In some instances, however, it is desirable to deploy a constellation in stages to gradually expand capacity.  ...  This paper specifically addresses the problem of determining the optimal assignment for transferring on-orbit satellites in constellation A to constellation B such that the total ∆V for the reconfiguration  ...  The combination of this algorithm with the orbital reconfiguration problem is the main contribution of this article.  ... 
doi:10.1016/j.actaastro.2007.02.008 fatcat:nbowf7snpbdhhega7vq4a2fsee

Developing resource consolidation frameworks for moldable virtual machines in clouds

Ligang He, Deqing Zou, Zhang Zhang, Chao Chen, Hai Jin, Stephen A. Jarvis
2014 Future generations computer systems  
Experiments have been conducted in this paper to evaluate the performance of the GA and the reconfiguration algorithm.  ...  This paper considers the scenario where multiple clusters of Virtual Machines (i.e., termed as Virtual Clusters) are hosted in a Cloud system consisting of a cluster of physical nodes.  ...  In order to evaluate the impact of the spare capacity on the number of saved nodes, we also conducted the experiments in which the spare capacity in each node is set as 10%.  ... 
doi:10.1016/j.future.2012.05.015 fatcat:sgesxyw2pndfthmp32urpboyj4

Efficient Fault-Tolerant Topology Reconfiguration Using a Maximum Flow Algorithm

Yu Ren, Leibo Liu, Shouyi Yin, Jie Han, Shaojun Wei
2015 ACM Transactions on Reconfigurable Technology and Systems  
With limited resources on a chip, an important question concerning topology reconfiguration is how to improve reliability by using the most of the spare resources with the least overhead.  ...  An enhanced approach using a minimum-cost MF algorithm is further shown to be efficient in the fault-tolerant reconfiguration of heterogeneous reconfigurable architectures. in memories using redundant  ...  The reconfiguration controller calculates the repair paths and then assigns new indices to the PEs.  ... 
doi:10.1145/2700417 fatcat:abnkm7ibz5hnzkcyen67gf3goi
« Previous Showing results 1 — 15 out of 5,687 results