This post has been relocated to https://blogs.qub.ac.uk/DIPSA/on-designing-structure-aware-high-performance-graph-algorithms-phd-thesis/
On Designing Structure-Aware High-Performance Graph Algorithms (PhD Thesis)
Reply
Tag Archives: locality
LaganLighter Source Code
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/laganlighter-source-code/
LOTUS: Locality Optimizing Triangle Counting – PPOPP’22
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/lotus-locality-optimizing-triangle-counting/
Locality Analysis of Graph Reordering Algorithms – IISWC’21
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/locality-analysis-of-graph-reordering-algorithms/
Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing – ICPP’21
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/exploiting-in-hub-temporal-locality-in-spmv-based-graph-processing/
How Do Graph Relabeling Algorithms Improve Memory Locality? ISPASS’21 (Poster)
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/how-do-graph-relabeling-algorithms-improve-memory-locality-ispass21/
VEBO: a vertex- and edge-balanced ordering heuristic to load balance parallel graph processing (Poster)
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/vebo-a-vertex-and-edge-balanced-ordering-heuristic-to-load-balance-parallel-graph-processing-poster/
VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/vebo-a-vertex-and-edge-balanced-ordering-heuristic-to-load-balance-parallel-graph-processing/
Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/accelerating-graph-analytics-by-utilising-the-memory-locality-of-graph-partitioning/
GraphGrind: Addressing Load Imbalance of Graph Partitioning
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/graphgrind-addressing-load-imbalance-of-graph-partitioning/