Optimistic parallelism requires abstractions
Milind V. Kulkarni, Keshav K. Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew · 2007
Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and run-time speculative execution have failed to uncover much parallelism in these applications, in spite of a lot of effort by the research community. These difficulties have even led some researchers to wonder if there is any coarse-grain parallelism worth exploiting in irregular applications.