Max Geigl

Learn More
One central problem in the execution of parallel nested loops with non-aane bounds is the precise scanning (i.e., enumeration) of the points in their iteration space and the detection of their termination. Scanning schemes have been proposed for both shared-memory and distributed-memory implementations. However, these schemes work only for perfectly nested(More)
  • 1