272 citations · 1.5k across the 62 of their papers we have counts for
6 papers · 1 filter
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…
Benchmarking Data Analysis and Machine Learning Applications on the Intel KNL Many-Core Processor
Chansup Byun, Jeremy Kepner, William Arcand +15
Knights Landing (KNL) is the code name for the second-generation Intel Xeon Phi product family. KNL has generated significant interest in the data analysis and machine learning com…
Scalable System Scheduling for HPC and Big Data
Albert Reuther, Chansup Byun, William Arcand +8
In the rapidly expanding field of parallel processing, job schedulers are the "operating systems" of modern big data architectures and supercomputing systems. Job schedulers alloca…