A Fast and Practical Algorithm for Absolute Dominators Searching for Very Large Scale Integration

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 207)

Abstract

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 Very Large Scale Integration (VLSI).

Keywords

ATPG Dominator gate Circuit graph Fanout 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Fujiwara H, Shimono T (1983) On the acceleration of test generation algorithms. IEEE Proc Int Symp Fault Tolerant Comput Syst (FTCS) 12(3):98–105Google Scholar
  2. 2.
    Kirkland T, Mercer MR (1987) A topological search algorithm for ATPG. IEEE Des Autom Conf 3(4):502–508Google Scholar
  3. 3.
    Harel D, Sheng R, Udell J (1987) Efficient single fault propagation in combinational circuits. Proc Int Conf Comput Aided Des 1(3):389–397Google Scholar
  4. 4.
    Harrel D (1985) A linear time algorithm for finding dominators in flow graphs and related problems. Annu Symp Theor Comput 17(1):185–194Google Scholar
  5. 5.
    Elissa K, Marques-Silva JP, Sakallah KA (1999) GRASP: a search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506–521MathSciNetCrossRefGoogle Scholar
  6. 6.
    Chang SC, Marek-Sadowska M, Cheng K-T (1996) Perturb and simplify: multilevel boolean network optimizer. IEEE Trans Comput Aided Des Integr Circ Syst 15:1494–1504CrossRefGoogle Scholar
  7. 7.
    Costa J, Monteiro J, Devadas S (1997) Switching activity estimation using limited depth reconvergent path analysis. Proc Int Symp Low Power Electron Des 33(15):184–189CrossRefGoogle Scholar
  8. 8.
    Young M (1969) The technical writer’s handbook. In: Lowry ES, Medlock CW (eds) Object code optimization, 12(2) edn., Communications of the ACMUniversity Science, Mill Valley, pp 13–22Google Scholar
  9. 9.
    Tarjan RE (1974) Finding dominators in directed graphs. SIAM J Comput 3(1):62–89MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Krenz-Baath R, Glowatz A, Schloeffel J (2007) Computation and application of absolute dominators in industrial designs. European Test Symp 2(12):137–144Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Northwest China Grid Company LimitedXi’anChina
  2. 2.Shaanxi Electric Power CorporationXi’anChina

Personalised recommendations