Obtaining Synchronization-Free Code with Maximum Parallelism

  • Ricard Gavald, Jordi Torresy
  • Published 1996


This paper addresses the problem of extracting the maximum synchronization free parallelism that may be present in loops. In order to reduce communication and synchronization overheads, some parallelizing compilers try to identify independent computational partitions | if there are any | of a sequential program. We focus on the case of loops with constant… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics