Optimistic parallelism requires abstractions


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… (More)
DOI: 10.1145/1250734.1250759
View Slides


12 Figures and Tables


Citations per Year

406 Citations

Semantic Scholar estimates that this publication has 406 citations based on the available data.

See our FAQ for additional information.