Locality-aware vertex scheduling for GPU-based graph computation.
Hyunsun ParkJunwhan AhnEunhyeok ParkSungjoo YooPublished in: VLSI-SoC (2015)
Keyphrases
- directed graph
- parallel computation
- undirected graph
- labeled graphs
- edge weights
- scheduling problem
- graph structure
- random walk
- hamiltonian cycle
- minimum weight
- average degree
- attributed graphs
- graph representation
- strongly connected
- round robin
- collision detection
- betweenness centrality
- maximum cardinality
- scheduling algorithm
- bipartite graph
- graph theory
- weighted graph
- connected subgraphs
- structured data
- subgraph isomorphism
- graph partitioning
- series parallel
- graphical models
- resource allocation
- spatial locality
- directed acyclic graph
- flexible manufacturing systems
- graph mining
- graphics hardware
- graph model
- minimum cost
- graph databases
- graph theoretic
- spanning tree