TY - JOUR
T1 - New, simpler linear-time dominators algorithm
AU - Buchsbaum, Adam L.
AU - Kaplan, Haim
AU - Rogers, Anne
AU - Westbrook, Jeffery R.
PY - 1998/11
Y1 - 1998/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0032266860&partnerID=8YFLogxK
U2 - 10.1145/295656.295663
DO - 10.1145/295656.295663
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0032266860
SN - 0164-0925
VL - 20
SP - 1265
EP - 1296
JO - ACM Transactions on Programming Languages and Systems
JF - ACM Transactions on Programming Languages and Systems
IS - 6
ER -