A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays

This paper deals with the reconfiguration of multipipeline arrays in the presence of both faulty processing elements (PE's) and switching elements (SE's). Different fault models are used for the PE's and SE's: a PE can he either fault free or faulty; a SE is modeled using a novel functional approach which relates its switching capabilities to its status. This permits a PE to retain a partial functionality in the presence of a fault. An appropriate transformation of the multipipeline army reconfiguration problem to a maximum flow problem is then presented.The conditions under which this transformation is possible, are fully analyzed. A reconfiguration algorithm based on the Maximum Flow Algorithm, is presented; the proposed algorithm is optimal as the number of reconfigured pipelines is maximized.

show abstract

A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays

Cited by 6 publications

References 146 publications

Fault-tolerant rank order filtering for image enhancement

Fault-tolerant rank order filtering for image enhancement

Yield enhancement of programmable ASIC arrays by reconfiguration of circuit placements

On the optimal reconfiguration of multipipeline arrays in the presence of faulty processing and switching elements

Contact Info

Product

Resources

About