20 citations · 35 across the 9 of their papers we have counts for
12 papers
Combining Performance and Productivity: Accelerating the Network Sensing Graph Challenge with GPUs and Commodity Data Science Software
Siddharth Samsi, Dan Campbell, Emanuel Scoullos +1
The HPEC Graph Challenge is a collection of benchmarks representing complex workloads that test the hardware and software components of HPC systems, which traditional benchmarks, s…
-Motif: Parallel Subgraph Isomorphism via Tabular Operations for Scalable Layout Selection
Yulun Wang, Esteban Ginez, Jamie Friel +4
Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving structural relations…
Design and Implementation of Knowledge Base for Runtime Management of Software Defined Hardware
Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan +1
Runtime-reconfigurable software coupled with reconfigurable hardware is highly desirable as a means towards maximizing runtime efficiency without compromising programmability. Comp…
Scalable Hash Table for NUMA Systems
Alok Tripathy, Oded Green
Hash tables are used in a plethora of applications, including database operations, DNA sequencing, string searching, and many more. As such, there are many parallelized hash tables…
ButterFly BFS -- An Efficient Communication Pattern for Multi Node Traversals
Oded Green
Breadth-First Search (BFS) is a building block used in a wide array of graph analytics and is used in various network analysis domains: social, road, transportation, communication,…
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Oded Green, James Fox, Jeffrey Young +2
Graph processing is typically considered to be a memory-bound rather than compute-bound problem. One common line of thought is that more available memory bandwidth corresponds to b…