RESEARCH

E. Parker and S. Chatterjee.
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas.
In Proceedings of the 13th International Conference on Compiler Construction (CC), April 2004.

E. Parker.
Analyzing the Behavior of Loop Nests in the Memory Hierarchy: Methods, Tools, and Applications.
Poster presentation at Conference on High-Speed Computing, April 2003.

E. Parker.
Compile-time Analysis of Loop Nest Behavior in Cache Memory.
Poster presentation at Conference on High-Speed Computing, April 2002.

E. Parker, B. de Supinski, and D. Quinlan.
Measuring the Regularity of Array References.
Poster presentation at LACSI Symposium, October 2001.
Also available as Lawrence Livermore National Laboratory Technical Report UCRL-JC-144545-abs.

P. J. Hanlon, D. Chung, S. Chatterjee, D. Genius, A. R. Lebeck, and E. Parker.
The Combinatorics of Cache Misses during Matrix Multiplication.
Journal of Computer and System Sciences, August 2001.

S. Chatterjee, E. Parker, P. J. Hanlon, and A. R. Lebeck.
Exact Analysis of Cache Misses in Nested Loops.
In Proceedings of the International Symposium on Programming Language Design and Implementation (PLDI), June 2001.