An IDA algorithm for optimal spare allocation
Michail G. Lagoudakis · 1999
A new algorithm for the Optimal Spare .4llocationproblem in reconfigurable arrays is presented.It is based on a previously published branch and bound search method [4].Enhanced with a strong heuristic function, it yields an effective .I' search, which performs more efficiently in the iterative deepening implementation (IDA').X parallel implementation of the algorithm for a distributed shared memory machine using TreadMarksTM was used for evaluation.The results demonstrate the efficiency of the scheme and show how computationally intensive problems can be handled by appropriate domain heuristics and cooperative distributed computational power.