A new, simpler linear-time dominators algorithm-Reference-Cited by-同舟云学术

A new, simpler linear-time dominators algorithm

Published:1998-11 Issue:6 Volume:20 Page:1265-1296
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

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

Affiliation:

1. AT&T Labs, Florham Park, NJ

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

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/295656.295663

Reference29 articles.

1. AHO A. V. AND ULLMAN J. D. 1972. The Theory of Parsing Translation and Compiling. Vol. 2 Compiling. Prentice-Hall Englewood Cliffs N.J. AHO A. V. AND ULLMAN J. D. 1972. The Theory of Parsing Translation and Compiling. Vol. 2 Compiling. Prentice-Hall Englewood Cliffs N.J.

2. ALSTRUP S. HAREL D. LAURIDSEN P. W. AND THORUP M. 1997. Dominators in linear time. Manuscript available at ftp ://ftp. diku. dk/pub/diku/users/stephen/dom ps. 10.1137/S0097539797317263 ALSTRUP S. HAREL D. LAURIDSEN P. W. AND THORUP M. 1997. Dominators in linear time. Manuscript available at ftp ://ftp. diku. dk/pub/diku/users/stephen/dom ps. 10.1137/S0097539797317263

3. APPEL A. W. 1998. Modern Compiler Implementation in C. Cambridge University Press Cambridge U.K. APPEL A. W. 1998. Modern Compiler Implementation in C. Cambridge University Press Cambridge U.K.

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sharing Equality is Linear;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07

2. 2-vertex connectivity in directed graphs;Information and Computation;2018-08

3. HotSpots;Proceedings of the 2017 ACM on Conference on Information and Knowledge Management;2017-11-06

4. Dominator Tree Certification and Divergent Spanning Trees;ACM Transactions on Algorithms;2016-02-08

5. Data-Aware Vaccine Allocation Over Large Networks;ACM Transactions on Knowledge Discovery from Data;2015-10-26