Progress Summary: Previous Periods

• Parallelization framework for strict independence
  • Generic: parameterized w.r.t.
    • the concept of independence
    • the analysis used for simplification
    • the annotation algorithm (based on graphs)
  • Algorithms: MEL, CDG, UDG
  • Simplification methodology
    Analyses: Sharing, Freeness, Linearity

• Parallelization framework for non-strict independence
  • Methodology for compile-time detection of dependencies:
    Based on sharing and freeness information
  • Methodology for efficient exploitation of NSI: separation of environments, run-time tests, etc
  • Algorithm for annotation implemented: URLP (only unconditional)
  • Preliminary assessment

• Optimizations based on analysis information
  • basic idea: ``Abstract Executability''