A fast algorithm for finding common multiple-vertex dominators in circuit graphs

Authors:
René Krenz;Elena Dubrova
Affiliations:
IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden;IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 14
Cited 1

A linear algorithm for finding dominators in flow graphs and related problems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A topological search algorithm for ATPG

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Generalized dominators and post-dominators

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An OV* E algorithm for finding immediate multiple-vertex dominators

Information Processing Letters
Switching activity estimation using limited depth reconvergent path analysis

ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
A new, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Dominators in Linear Time

SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate predominators in a directed graph [H]

Communications of the ACM
Object code optimization

Communications of the ACM
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Fast Algorithm for Computing Spectral Transforms of Boolean and Multiple-Valued Functions on Circuit Representation

ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic

Debugging with dominance: on-the-fly RTL debug solution implications

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a fast algorithm for computing common multiple-vertex dominators in circuit graphs. Dominators are widely used in CAD applications such as satisfiability checking, equivalence checking, ATPG, technology mapping, decomposition of Boolean functions and power optimization. State of the art algorithms compute single-vertex dominators in linear time. However, the rare appearance of single-vertex dominators in circuit graphs requires the investigation of a broader type of dominators and the development of algorithms to compute them. We show that our new technique is faster and computes more common multiple-vertex dominators than existing techniques.