Jens Knoop, Oliver Rüthing, Bernhard Steffen  Home/Search
Context Related
| sunshine.cs.unidortmund.de...lcm.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunshine.cs.unidortmund.de/~r... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient as standard uni-directional analyses. The point of our algorithm is the decomposition of the bi-directional structure of the known placement algorithms into a sequence of a backward and a forward analysis, which directly implies the efficiency result. Moreover, the new compositional structure opens the algorithm for modification: two further uni-directional... (Update)
Cited by: More
Compiler Optimization of Value Communication for Thread-Level.. - Zhai (2005) (Correct)
Hardware Support for Thread-Level Speculation - Steffan (2003) (Correct)
Inter-Iteration Scalar Replacement in the Presence of - Conditional Control-Flow Mihai (2004) (Correct)
Similar documents (at the sentence level):
75.0%: Lazy Code Motion - Knoop, Rüthing, Steffen (1992) (Correct)
5.5%: Optimal Code Motion: Theory and Practice - Knoop, Rüthing, Steffen (1993) (Correct)
Active bibliography (related documents): More All
0.9: Lazy Strength Reduction - Knoop, Rüthing, Steffen (1993) (Correct)
0.7: The Interprocedural Coincidence Theorem - Knoop, Steffen (1992) (Correct)
0.6: Code Motion and Code Placement: Just Synonyms? - Knoop, Rüthing, Steffen (1998) (Correct)
Similar documents based on text: More All
0.2: Parallelism for Free: Efficient and Optimal Bitvector.. - Knoop, Steffen, Vollmer (1996) (Correct)
0.2: Code Motion - Stephenson (1997) (Correct)
0.2: An Integrated Heuristic for Best Effort Scheduling of.. - Striegel, Reynolds.. (1998) (Correct)
Related documents from co-citation: More All
51: Global optimization by suppression of partial redundancies (context) - Morel, Renviose - 1979
37: Optimal code motion: Theory and practice - Knoop, Ruthing et al. - 1994
36: Partial Dead Code Elimination - Knoop, Ruthing et al. - 1994
BibTeX entry: (Update)
J. Knoop, O. Ruthing, and B. Steffen, "Lazy Code Motion," ACM SIGPLAN Conf. on Prog. Lang. Design and Implementation, pages 224-234, 1992. http://citeseer.ist.psu.edu/knoop92lazy.html More
@inproceedings{ knoop92lazy,
author = "J. Knoop and O. Ruething and B. Steffen",
title = "Lazy code motion",
booktitle = "Proceedings of the {ACM} {SIGPLAN} '92 Conference on Programming Language Design and Implementation",
journal = "SIGPLAN Notices",
volume = "27",
number = "7",
month = "June",
address = "San Francisco, CA",
pages = "224--234",
year = "1992",
url = "citeseer.ist.psu.edu/knoop92lazy.html" }
Citations (may not include all citations):225 Flow analysis of computer programs (context) - Hecht - 1977
129 Global value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
128 Global optimization by suppression of partial redundancies (context) - Morel, Renvoise - 1979
116 Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
93 Global data flow analysis and iterative algorithms (context) - Kam, Ullman - 1976
53 Applications of path compression on balanced trees (context) - Tarjan - 1979
51 Fast algorithms for solving path problems (context) - Tarjan - 1981
43 A composite hoisting-strength reduction transformation for g.. (context) - Joshi, Dhamdhere - 1982
43 A composite hoisting-strength reduction transformation for g.. (context) - Joshi, Dhamdhere - 1982
39 A unified approach to path problems (context) - Tarjan - 1981
39 A fast and usually linear algorithm for global flow analysis (context) - Graham, Wegman - 1976
36 Practical adaptation of the global optimization algorithm of.. (context) - Dhamdhere - 1991
34 Global optimization by suppression of partial redundancies (context) - Drechsler, Stadel et al. - 1988
27 Data flow analysis as model checking (context) - Steffen - 1991
24 Lazy strength reduction - Knoop, Ruthing et al.
23 A simple algorithm for global data flow analysis problems (context) - Hecht, Ullman - 1977
22 The value flow graph: A program representation for optimal p.. - Steffen, Knoop et al. - 1990
22 A fast algorithm for code movement optimization (context) - Dhamdhere - 1988
16 Efficient code motion and an adaption to strength reduction - Steffen, Knoop et al. - 1991
13 Node listings applied to data flow analysis (context) - Kennedy - 1975
11 Fast algorithms for the elimination of common subexpressions (context) - Ullman - 1973
10 Interprocedural elimination of partial redundancies (context) - Morel, Renvoise - 1981
10 Characterization of program loops in code optimization (context) - Dhamdhere - 1983
9 Data flow analysis and global optimization (context) - Morel - 1984
8 Global optimization by suppression of partial redundancies (context) - Sorkin, comments et al. - 1989
7 Analysis of a simple algorithm for global flow problems (context) - Hecht, Ullman - 1973
7 Node listings for reducible flow graphs (context) - Aho, Ullman - 1975
6 A portable machine independent optimizer -- Design and measu.. (context) - Chow - 1983
2 Efficient and optimal interprocedural bit-vector data flow a.. (context) - Knoop, Steffen
2 Rheinisch-Westfalische Technische Hochschule Aachen (context) - Knoop, Steffen - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sunshine.cs.uni-dortmund.de/~ruething/): More
Efficient Code Motion and an Adaption to Strength Reduction - Steffen, Knoop, Rüthing (1991) (Correct)
The Power of Assignment Motion - Knoop, Rüthing, Steffen (1995) (Correct)
Towards a Tool Kit for the Automatic Generation of.. - Knoop, Rüthing, Steffen (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC