SIMULATED ANNEALING ALGORITHM FOR THE FAULT COVERING OF REDUNDANT RAMS Yeow-Meng Chee* Hon-Wai Leongt Andrew Limn Chor-Ping Lowt
نویسندگان
چکیده
We present a fast simulated annealing algorithm for the problem of fault covering of redundant RAMS. The algorithm has been implemented and tested on various benchmark problems and has performed very well. Our simulations also indicate that the algorithm is very fast. For all the repairable chips tested, it took less than one second to find a repair solution.
منابع مشابه
Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem
In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...
متن کاملA Technology-Independent Methodology of Placement Generation for Analog Circuit
An automatic placement system with emphasis on technology independent methodology and device matching consideration for analog layout design is presented. A novel optimization approach based on circuit partitioning, simulated annealing and branch-and-bound algorithm is proposed to solve the placement problem. The move set used to generate perturbations for annealing is capable of arriving at an...
متن کاملارائه یک الگوریتم ابتکاری جدید برای حل مساله مکانیابی پوشش کلی
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملNew bounds for binary covering arrays using simulated annealing
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving ...
متن کامل