26 citations · 27 across the 4 of their papers we have counts for
8 papers
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs
Tahsin Reza, Geoffrey Sanders, Roger Pearce
Given an edge-weighted graph and a set of known seed vertices, a network scientist often desires to understand the graph relationships to explain connections between the seed verti…
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
Trevor Steil, Tahsin Reza, Keita Iwabuchi +3
Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched gra…
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Tahsin Reza, Hassan Halawa, Matei Ripeanu +2
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: they do not scale to process large graphs a…
UMap: Enabling Application-driven Optimizations for Page Management
Ivy B. Peng, Marty McFadden, Eric Green +5
Leadership supercomputers feature a diversity of storage, from node-local persistent memory and NVMe SSDs to network-interconnected flash memory and HDD. Memory mapping files on di…
Scalable Breadth-First Search on a GPU Cluster
Yuechao Pan, Roger Pearce, John D. Owens
On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadth-first search (BFS) on a scale-free graph extremely challenging. By separating h…
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Geoffrey Sanders, Roger Pearce, Timothy La Fond +1
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world gra…