Return to CLIP Main Page

Wrap-up: strong points

• Several generations of parallelizing compilers for LP and CLP [85-97]:
  • Good compilation speed, proved correct and efficient.
  • Speedups over state-of-the-art sequential systems on applications.
  • Good demonstrators of abstract interpretation as data-flow analysis technique.
  • Now including granularity control.
  Improved on hand parallelizations on several large applications.
• Areas of particularly good progress:
  • Concepts of independence (pointers, search/speculation, constraints...).
  • Inter-procedural analysis (dynamic data, recursion, pointers/aliasing, etc.).
  • Parallelization algorithms for conditional dependency graphs.
  • Dealing with irregularity:
    • efficient task representation and fast dynamic scheduling,
    • static inference of task cost functions - granularity control.
  • Mixed static/dynamic parallelization techniques.