Comparing parallel performance of Go and C++ TBB on a direct acyclic task graph using a dynamic programming problem.
Doug SerfassPeiyi TangPublished in: ACM Southeast Regional Conference (2012)
Keyphrases
- dynamic programming
- random walk
- np hard
- graph theory
- structured data
- directed graph
- graph representation
- connected graphs
- depth first search
- shared memory
- weighted graph
- graph structure
- greedy algorithm
- single machine
- graph mining
- parallel processing
- bounded treewidth
- bipartite graph
- reinforcement learning
- graph matching
- graph model
- equivalence classes
- connected components
- graph structures
- database schemes
- state space