Optimistic parallelism benefits from data partitioning
Milind V. Kulkarni, Keshav K. Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew · 2008
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 arising from the use of iterative algorithms that perform computations on elements of worklists. In some irregular applications, the computations on different elements are independent. In other applications, there may be complex patterns of dependences between these computations.