Graph Challenge Champions

2020 Champions

  • Scaling Graph Clustering with Distributed Sketches - Benjamin Priest (LLNL), Alec Dunton (CU Boulder), Geoffrey Sanders (LLNL)
  • At-Scale Sparse Deep Neural Network Inference With Efficient GPU Implementation - Mert Hidayetoglu, Carl Pearson, Vikram Sharma Mailthody (UIUC), Eiman Ebrahimi (Nvidia), Jinjun Xiong  (IBM)), Rakesh Nagi, Wen-mei W. Hwu (UIUC)
  • A Novel Inference Algorithm for Large Sparse Neural Network using Task Graph Parallelism - Dian-Lun Lin, Tsung-Wei Huang (Univ of Utah)
  • TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure - Sayan Ghosh, Mahantesh Halappanavar (PNNL)

2020 Innovation Awards

  • Combinatorial Tiling for Sparse Neural Networks - Filip Pawłowski (ENS Lyon), Rob H. Bisseling (Utrecht), Bora Ucar (CNRS), Albert-Jan Yzelman (Huawei)
  • Studying the Effects of Hashing of Sparse Deep Neural Networks on Data and Model Parallelisms - Mohammad Hasanzadeh Mofrad, Rami Melhem (Univ of Pittsburgh), Yousuf Ahmad, Mohammad Hammoud (CMU Qatar)
  • Incremental Streaming Graph Partitioning - Lisa Durbeck, Peter Athanas (Virginia Tech)

2020 Honorable Mention

  • KTRUSSEXPLORER: Exploring the Design Space of K-truss Decomposition Optimizations on GPUs - Safaa Diab, Mhd Ghaith Olabi, Izzat El Hajj (American University of Beirut)
  • Analysis of Floating-Point Round-Off Error in Linear Algebra Routines for Graph Clustering - L. Minah Yang (CU Boulder), Alyson Fox (LLNL)

2019 Champions

2019 Innovation Awards

2019 Student Innovation Awards

2019 Finalists

2019 Honorable Mention


2018 Champions

2018 Finalists

2018 Innovation Awards

2018 Student Innovation Awards

2018 Honorable Mention


Analysis of all 2017 Triangle Counting Submissions

2017 Champions

2017 Finalists

2017 Innovation Awards

2017 Student Innovation Awards

2017 Honorable Mention