A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
2000
Parallel Computing
Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the
doi:10.1016/s0167-8191(00)00051-x
fatcat:woapzcdi35dzziw2tpyuyutsj4