• Publications
  • Influence
A data locality optimizing algorithm
TLDR
An algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling is proposed, and is successful in optimizing codes such as matrix multiplication, successive over-relaxation, LU decomposition without pivoting, and Givens QR factorization. Expand
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
TLDR
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs, and develops a system called bddbddb that automatically translates Datalog programs into highly efficient BDD implementations. Expand
The Stanford Dash multiprocessor
TLDR
The overall goals and major features of the directory architecture for shared memory (Dash), a distributed directory-based protocol that provides cache coherence without compromising scalability, are presented. Expand
SUIF: an infrastructure for research on parallelizing and optimizing compilers
TLDR
The SUIF compiler is built into a powerful, flexible system that may be useful for many other researchers and the authors invite you to use and welcome your contributions to this infrastructure. Expand
Efficient context-sensitive pointer analysis for C programs
TLDR
An efficient technique for context-sensitive pointer analysis that is applicable to real C programs and based on a low-level representation of memory locations that safely handles all the features of C. Expand
Software pipelining: an effective scheduling technique for VLIW machines
  • M. Lam
  • Computer Science
  • SIGP
  • 1 June 1988
TLDR
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors, and proposes a hierarchical reduction scheme whereby entire control constructs are reduced to an object similar to an operation in a basic block. Expand
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
  • M. E. Wolf, M. Lam
  • Computer Science
  • IEEE Trans. Parallel Distributed Syst.
  • 1 October 1991
TLDR
The loop transformation theory is applied to the problem of maximizing the degree of coarse- or fine-grain parallelism in a loop nest and it is shown that the maximum degree of parallelism can be achieved by transforming the loops into a nest of coarsest fullypermutable loop nests and wavefronting the fully permutable nests. Expand
Software pipelining: an effective scheduling technique for VLIW machines
TLDR
It is shown that by using an improved algorithm, near-optimal performance can be obtained without specialized hardware and a hierarchical reduction scheme is proposed whereby entire control constructs are reduced to an object similar to an operation in a basic block. Expand
Finding Security Vulnerabilities in Java Applications with Static Analysis
TLDR
This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks based on a scalable and precise points-to analysis. Expand
...
1
2
3
4
5
...