activity
20162020
most citedStatic Graph Challenge: Subgraph Isomorphism

77 citations · 199 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DC2020★ 9 cited

GraphChallenge.org Triangle Counting Performance

Siddharth Samsi, Jeremy Kepner, Vijay Gadepally +9

The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been…

cs.DC2018★ 25 cited

GraphChallenge.org: Raising the Bar on Graph Analytic Performance

Siddharth Samsi, Vijay Gadepally, Michael Hurley +9

The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been…

cs.DC2017★ 68 cited

Streaming Graph Challenge: Stochastic Block Partition

Edward Kao, Vijay Gadepally, Michael Hurley +9

An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition prob…

cs.DC2017★ 77 cited

Static Graph Challenge: Subgraph Isomorphism

Siddharth Samsi, Vijay Gadepally, Michael Hurley +9

The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. Th…

cs.DC2016★ 20 cited

Novel Graph Processor Architecture, Prototype System, and Results

William S. Song, Vitaliy Gleyzer, Alexei Lomakin +1

Graph algorithms are increasingly used in applications that exploit large databases. However, conventional processor architectures are inadequate for handling the throughput and me…