Decoupling Schedule, Topology Layout, and Algorithm to Easily Enlarge the Tuning Space of GPU Graph Processing.
Shinnung JeongYongwoo LeeJaeho LeeHeelim ChoiSeungbin SongJinho LeeYoungsok KimHanjun KimPublished in: PACT (2022)
Keyphrases
- dynamic programming
- graph structure
- learning algorithm
- preprocessing
- graph based algorithm
- space requirements
- search space
- k means
- np hard
- parallel implementation
- nearest neighbor graph
- delaunay triangulation
- higher dimensional
- parameter settings
- tree structure
- particle swarm optimization
- optimal solution
- random walk
- real time
- gpu accelerated
- fully connected
- worst case
- simulated annealing
- minimum spanning tree
- topology preserving
- graph construction
- configuration space
- objective function
- graph search
- graph partitioning
- image segmentation
- clustering method