New, simpler linear-time dominators algorithm

Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook

Research output: Contribution to journalArticlepeer-review

Abstract

We present a new linear-time algorithm to find the immediate dominators of all vertices in a flowgraph. Our algorithm is simpler than previous linear-time algorithms: rather than employ complicated data structures, we combine the use of microtrees and memorization with new observations on a restricted class of path compressions. We have implemented our algorithm, and we report experimental results that show that the constant factors are low. Compared to the standard, slightly superlinear algorithm of Lengauer and Tarjan, which has much less overhead, our algorithm runs 10-20% slower on real flowgraphs of reasonable size and only a few percent slower on very large flowgraphs.

Original languageEnglish
Pages (from-to)1265-1296
Number of pages32
JournalACM Transactions on Programming Languages and Systems
Volume20
Issue number6
DOIs
StatePublished - Nov 1998
Externally publishedYes

Fingerprint

Dive into the research topics of 'New, simpler linear-time dominators algorithm'. Together they form a unique fingerprint.

Cite this