Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms.
Muhammad Amber HassaanMartin BurtscherKeshav PingaliPublished in: PPOPP (2011)
Keyphrases
- significant improvement
- computational cost
- computational efficiency
- data sets
- highly efficient
- theoretical analysis
- computationally efficient
- computational complexity
- optimization problems
- times faster
- database
- data structure
- probabilistic model
- learning algorithm
- orders of magnitude
- genetic algorithm
- machine learning
- recently developed
- graph theory
- data mining
- data reduction
- parallel computation