Saturday, November 17, 2018

distributed graph processing, HPC graph algorithm, SC2018



https://sc18.supercomputing.org/presentation/?id=ws_ia121&sess=sess168

Many-Core Graph Workload Analysis
https://sc18.supercomputing.org/presentation/?id=pap335&sess=sess218


https://sc18.supercomputing.org/presentation/?id=bof142&sess=sess409


ShenTu: Processing Multi-Trillion Edge Graphs on Millions of Cores in Seconds
faimGraph: High Performance Management of Fully-Dynamic Graphs Under Tight Memory Constraints on the GPU
https://sc18.supercomputing.org/presentation/?id=pap167&sess=sess208


There Are Trillions of Little Forks in the Road: Choose Wisely! -- Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline
https://sc18.supercomputing.org/presentation/?id=ws_ia116&sess=sess168




No comments:

Post a Comment