Graph-Theoretically Optimal Memory Banking for Stencil-Based Computing Kernels.
Juan EscobedoMingjie LinPublished in: FPGA (2018)
Keyphrases
- optimal solution
- dynamic programming
- random walk
- linear combination
- graph representation
- graph theory
- memory usage
- connected components
- directed graph
- homology generators
- graph theoretic
- bipartite graph
- kernel methods
- support vector
- memory requirements
- graph databases
- kernel function
- high dimensional
- minimum spanning tree
- graph kernels
- memory size
- solution path
- neural network