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
Author Archives: Mohsen
LaganLighter Source Code
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/laganlighter-source-code/
MASTIFF: Structure-Aware Minimum Spanning Tree/Forest – ICS’22
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/mastiff-structure-aware-minimum-spanning-tree-forest/
SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs – ISPASS’22 (Poster)
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/sapco-sort-optimizing-degree-ordering-for-power-law-graphs/
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/
Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs – IEEE CLUSTER’21
This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/thrifty-label-propagation-fast-connected-components-for-skewed-degree-graphs/
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/