A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimistic parallelism benefits from data partitioning
2008
SIGPLAN notices
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism that arises from the use of iterative algorithms that perform computations on elements of worklists of various kinds. In some irregular applications, the computations on different elements are independent. In other applications, there may be complex patterns of dependences between these computations. The Galois system
doi:10.1145/1353536.1346311
fatcat:4dgolpsnibcwxmh2pejswxab2m