Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
Array privatization for parallel execution of loops
ICS '92 Proceedings of the 6th international conference on Supercomputing
Value dependence graphs: representation without taxation
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
GIVE-N-TAKE—a balanced code placement framework
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
Characterizations of Reducible Flow Graphs
Journal of the ACM (JACM)
Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
Data Flow Analysis for Procedural Languages
Journal of the ACM (JACM)
Vector Execution of Flow Graphs
Journal of the ACM (JACM)
A least cost partition algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Comparative study of page-based and segment-based software DSM through compiler optimization
Proceedings of the 14th international conference on Supercomputing
Global optimization by suppression of partial redundancies
Communications of the ACM
Communications of the ACM
Register allocation via usage counts
Communications of the ACM
A balanced code placement framework
ACM Transactions on Programming Languages and Systems (TOPLAS)
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of a simple algorithm for global data flow problems
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized common subexpressions in very high level languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic evaluation and the global value graph
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Application of lattice algebra to loop optimization
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A fast and usually linear algorithm for global flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Prime subprogram parsing of a program
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependence graphs and compiler optimizations
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A precise inter-procedural data flow algorithm
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Annals of the History of Computing
Compiler-directed run-time monitoring of program data access
Proceedings of the 2002 workshop on Memory system performance
An efficient static analysis algorithm to detect redundant memory operations
Proceedings of the 2002 workshop on Memory system performance
An interactive program advising system
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
Node listings for reducible flow graphs
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On finding lowest common ancestors in trees
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Vector execution of flow graphs(Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Flow graph analysis using linear connected regions
ACM '76 Proceedings of the 1976 annual conference
A survey of compiler optimization techniques
ACM '73 Proceedings of the ACM annual conference
Compiler design for efficient code generation and program optimization
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Machine-independent PASCAL code optimization
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Automatic and semiautomatic optimization of SETL
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Evaluation of Compiler-Assisted Software DSM Schemes for a Workstation Cluster
IWIA '99 Proceedings of the 1999 International Workshop on Innovative Architecture
ACM SIGPLAN Notices
Segment protection for embedded systems using run-time checks
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Orchestrating data transfer for the cell/B.E. processor
Proceedings of the 22nd annual international conference on Supercomputing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Register assignment algorithm for generation of highly optimized object code
IBM Journal of Research and Development
The history of language processor technology in IBM
IBM Journal of Research and Development
Node listings for reducible flow graphs
Journal of Computer and System Sciences
Testing flow graph reducibility
Journal of Computer and System Sciences
On-line sensing task optimization for shared sensors
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Compiler-Assisted software DSM on a WAN cluster
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Fast profile-based partial redundancy elimination
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Optimization of hierarchical directed graphs
Computer Languages
Optimization of very high level languages-I
Computer Languages
Use-definition chains with applications
Computer Languages
A study of irreducibility in C programs
Software—Practice & Experience
A new algorithm for identifying loops in decompilation
SAS'07 Proceedings of the 14th international conference on Static Analysis
Compressing IP forwarding tables: towards entropy bounds and beyond
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
SEC'13 Proceedings of the 22nd USENIX conference on Security
Hi-index | 0.05 |
When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is optimization necessary and two, to what extent is it possible. When considering the second question, one might immediately become discouraged since it is well known that the program equivalency problem is recursively unsolvable. It is, of course, clear from this that there will never be techniques for generating a completely optimum program. These unsolvability results, however, do not preclude the possibility of ad hoc techniques for program improvement or even a partial theory which produces a class of equivalent programs optimized in varying degrees. The reasons why optimization is required seem to me to fall in two major categories. The first I will call “local” and the second “global”.