272 citations · 1.8k across the 82 of their papers we have counts for
5 papers · 2 filters
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…
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…
Performance Measurements of Supercomputing and Cloud Storage Solutions
Michael Jones, Jeremy Kepner, William Arcand +10
Increasing amounts of data from varied sources, particularly in the fields of machine learning and graph analytics, are causing storage requirements to grow rapidly. A variety of t…
MIT SuperCloud Portal Workspace: Enabling HPC Web Application Deployment
Andrew Prout, William Arcand, David Bestor +13
The MIT SuperCloud Portal Workspace enables the secure exposure of web services running on high performance computing (HPC) systems. The portal allows users to run any web applicat…
D4M 3.0
Lauren Milechin, Alexander Chen, Vijay Gadepally +3
The D4M tool is used by hundreds of researchers to perform complex analytics on unstructured data. Over the past few years, the D4M toolbox has evolved to support connectivity with…