Optimally Synchronizing Doacross Loops on Shared Memory Multiprocessors

  • Alan L. CoxzDepartments
  • Published 1997


We present two algorithms to minimize the amount of synchronization added when parallelizing a loop with loop{carried dependences. In contrast to existing schemes, our algorithms add lesser synchronization, while preserving the parallelism that can be extracted from the loop. Our rst algorithm uses an interval graph representation of the dependence \overlap… (More)

1 Figure or Table


  • Presentations referencing similar topics