The Tao of Parallelism in Algorithms

Free registration required

Executive Summary

For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "Regular" algorithms that use dense arrays, such as finite-differences and FFTs. In this paper, the authors argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "Irregular" data structures like graphs, trees, and sets.

  • Format: PDF
  • Size: 788.1 KB