Leveraging data-structure semantics for efficient algorithmic parallelism
Romain E. Cledat, Kaushik Ravichandran, Santosh Pande · 2011
Irregular or pointer-based structures such as graphs and trees are commonly used in algorithms dealing with sparse data. Given their reliance on pointers, these algorithms are difficult to analyze and the structure of their memory accesses is obfuscated which makes the extraction of parallelism difficult.