A Fast and Practical Algorithm for Absolute Dominators Searching

Absolute dominator search is an effective topological analysis method to improve performance of computer-aided design (CAD) and automatic test pattern generation (ATPG). In this paper, we present a new algorithm for searching absolute dominators of multiple- output circuits to solve inefficient and complex computing in tradition algorithm. Compare with the tradition algorithm, the new algorithm analyzes the relations between different fanout nodes, and identifies absolute dominator for every fanout node in circuit, thus, the overall dominator graph is constructed without any changes for original circuit directly. The experimental results based on ISCAS85 and ITC99 benchmarks show a signification improvement in runtime, and it can meet the requirement of modern design and test for VLSI.