Skip to main content
Top

2013 | OriginalPaper | Chapter

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

Authors : Xiaojing Hu, Peng Li

Published in: Informatics and Management Science IV

Publisher: Springer London

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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).

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Fujiwara H, Shimono T (1983) On the acceleration of test generation algorithms. IEEE Proc Int Symp Fault Tolerant Comput Syst (FTCS) 12(3):98–105 Fujiwara H, Shimono T (1983) On the acceleration of test generation algorithms. IEEE Proc Int Symp Fault Tolerant Comput Syst (FTCS) 12(3):98–105
2.
go back to reference Kirkland T, Mercer MR (1987) A topological search algorithm for ATPG. IEEE Des Autom Conf 3(4):502–508 Kirkland T, Mercer MR (1987) A topological search algorithm for ATPG. IEEE Des Autom Conf 3(4):502–508
3.
go back to reference Harel D, Sheng R, Udell J (1987) Efficient single fault propagation in combinational circuits. Proc Int Conf Comput Aided Des 1(3):389–397 Harel D, Sheng R, Udell J (1987) Efficient single fault propagation in combinational circuits. Proc Int Conf Comput Aided Des 1(3):389–397
4.
go back to reference Harrel D (1985) A linear time algorithm for finding dominators in flow graphs and related problems. Annu Symp Theor Comput 17(1):185–194 Harrel D (1985) A linear time algorithm for finding dominators in flow graphs and related problems. Annu Symp Theor Comput 17(1):185–194
5.
go back to reference Elissa K, Marques-Silva JP, Sakallah KA (1999) GRASP: a search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506–521MathSciNetCrossRef Elissa K, Marques-Silva JP, Sakallah KA (1999) GRASP: a search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506–521MathSciNetCrossRef
6.
go back to reference 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–1504CrossRef 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–1504CrossRef
7.
go back to reference 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–189CrossRef 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–189CrossRef
8.
go back to reference 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–22 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–22
10.
go back to reference Krenz-Baath R, Glowatz A, Schloeffel J (2007) Computation and application of absolute dominators in industrial designs. European Test Symp 2(12):137–144 Krenz-Baath R, Glowatz A, Schloeffel J (2007) Computation and application of absolute dominators in industrial designs. European Test Symp 2(12):137–144
Metadata
Title
A Fast and Practical Algorithm for Absolute Dominators Searching for Very Large Scale Integration
Authors
Xiaojing Hu
Peng Li
Copyright Year
2013
Publisher
Springer London
DOI
https://doi.org/10.1007/978-1-4471-4793-0_23

Premium Partners