Omega Technical Reports

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format. However, this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the Department of Computer Science of the University of Maryland at College Park under terms that include this permission. All other rights are reserved by the author(s).

CS-TR-3457

Wayne Kelly, William Pugh, Evan Rosser, Tatiana Shpeisman. Transitive Closure of Infinite Graphs and its Applications. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, April 1994.

CS-TR-3317.1

Wayne Kelly, William Pugh, Evan Rosser. Code Generation for Multiple Mappings. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, December 1994.

CS-TR-3310

Vadim Maslov. Global Value Propagation Through Value Flow Graph and Its Use in Dependence Analysis. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, July 1994.

CS-TR-3297

Wayne Kelly, William Pugh. Finding Legal Reordering Transformations using Mappings. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, June 1994.

CS-TR-3250

William Pugh, David Wonnacott. Static Analysis of Upper and Lower Bounds on Dependences and Parallelism. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, March 1994.

Keywords: Automatic Parallelization, Compilation, Optimization, Array Data Dependence Analysis, Presburger Arithmetic, Omega test, Dependence Relation

This paper will appear in ACM TOPLAS

CS-TR-3234

William Pugh. Counting Solutions to Presburger Formulas: How and Why. Dept. of Computer Science, Univ. of Maryland~University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, April 1993.

This paper will appear in the Proceedings of the 1994 ACM SIGPLAN Conference on Programming Language Design and Implementation

CS-TR-3196

William Pugh, David Wonnacott. An Exact Method for Analysis of Value-based Array Data Dependences. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, December 1993.

This paper appears in the Proceedings of the Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing

CS-TR-3193

Wayne Kelly, William Pugh. A Framework for Unifying Reordering Transformations. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, April 1993.

CS-TR-3192

William Pugh. Definitions of Dependence Distance. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, April 1993.

CS-TR-3191

William Pugh, David Wonnacott. Eliminating False Data Dependences using the Omega Test. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, December 1992.

CS-TR-3110

Vadim Maslov. Lazy Array Data-Flow Dependence Analysis. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, July 1993.

CS-TR-3109.1

Vadim Maslov, William Pugh. Simplifying Polynomial Constraints Over Integers to Make Dependence Analysis More Precise. University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, February 1994.

This is revised version of the CS-TR-3109 report that appeared July, 1993.

CS-TR-3108

Wayne Kelly, William Pugh. Determing Schedules based on Performance Estimation. Dept. of Computer Science, Univ. of Maryland~University of Maryland Institute for Advanced Computer Studies~Dept. of Computer Science, Univ. of Maryland, April 1993.