• Home
  • Search
  • GraphChallenge.org Sparse Deep Neural Network Performance
  • Open Access IconOpen Access
  • Cite Icon11
  • https://doi.org/10.1109/hpec43674.2020.9286253Copy DOI Icon

GraphChallenge.org Sparse Deep Neural Network Performance

  • Sep 22, 2020
  • Jeremy Kepner +7 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The MIT/IEEE/Amazon GraphChallenge.org encourages community approaches to developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present unique scalability difficulties. The Sparse Deep Neural Network (DNN) Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a challenge that is reflective of emerging sparse AI systems. The sparse DNN challenge is based on a mathematically well-defined DNN inference computation and can be implemented in any programming environment. In 2019 several sparse DNN challenge submissions were received from a wide range of authors and organizations. This paper presents a performance analysis of the best performers of these submissions. These submissions show that their state-of-the-art sparse DNN execution time, $T_{\rm DNN}$, is a strong function of the number of DNN operations performed, $N_{\rm op}$. The sparse DNN challenge provides a clear picture of current sparse DNN systems and underscores the need for new innovations to achieve high performance on very large sparse DNNs.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.