Parasol Compilers: Hybrid Analysis
Hybrid Analysis: How it Works
Memory Reference Aggregation and Classification

Data dependence analysis requires precise information on the relative order of write memory references with respect to all other references. Memory reference aggregation and classification computes, for each program context such as loop body, the following mutually disjoint sets of references:

The power of Hybrid Analysis lies in its capacity to tolerate static analysis failures. It does so by representing the RO, WF, and RW as Uniform Sets of References (USRs).

This classification scheme is biased towards collecting information useful to automatic parallelization. Other hybrid techniques could define other aggregation or/and classification methods using USRs.


Publications and Presentations

Silvius Rus, Lawrence Rauchwerger, "Hybrid Dependence Analysis for Automatic Parallelization," Technical Report, TR05-013, Parasol Laboratory, Department of Computer Science, Texas A&M University, Nov 2005.
Technical Report(ps, pdf, ppt, abstract)

Silvius Rus, Lawrence Rauchwerger, Jay Hoeflinger, "Hybrid Analysis: Static & Dynamic Memory Reference Analysis," International Journal of Parallel Programming, 31(4):251-283, Aug 2003. Also, In Proc. ACM Int. Conf. Supercomputing (ICS), pp. 274-284, New York City, Jun 2002. Also, Technical Report, TR02-002, Parasol Laboratory, Department of Computer Science, Texas A&M University, Jan 2002.
Journal(pdf, ppt, abstract) Proceedings(ps, pdf, ppt, abstract) Technical Report(ps, pdf, ppt, abstract)


HA: How It Works

Site Map