research
∙
03/25/2021
ButterFly BFS – An Efficient Communication Pattern for Multi Node Traversals
Breadth-First Search (BFS) is a building block used in a wide array of g...
share
research
∙
10/08/2019
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Graph processing is typically considered to be a memory-bound rather tha...
research
∙
07/05/2019
HashGraph – Scalable Hash Tables Using A Sparse Graph Data Structure
Hash tables are ubiquitous and used in a wide range of applications for ...
research
∙
07/10/2018
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Network analysis defines a number of centrality measures to identify the...
research
∙
04/12/2017
