Combinatorial Tiling for Sparse Neural Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Combinatorial Tiling for Sparse Neural Networks


Sparse deep neural networks (DNNs) emerged as the result of search for networks with less storage and lower computational complexity. The sparse DNN inference is the task of using such trained DNN networks to classify a batch of input data. We propose an efficient, hybrid model- and data-parallel DNN inference using hypergraph models and partitioners. We exploit tiling and weak synchronization to increase cache reuse, hide load imbalance, and hide synchronization costs. Finally, a blocking approach allows application of this new hybrid inference procedure for deep neural networks. We initially experiment using the hybrid tiled inference approach only, using the first five layers of networks from the IEEE HPEC 2019 Graph Challenge, and attain up to 2x speedup versus a data-parallel baseline
Fichier principal
Vignette du fichier
sparseNetworks.pdf (331.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02910997 , version 1 (03-08-2020)
hal-02910997 , version 2 (03-08-2020)
hal-02910997 , version 3 (03-09-2020)


  • HAL Id : hal-02910997 , version 3


Filip Pawłowski, Rob H Bisseling, Bora Uçar, Albert-Jan N Yzelman. Combinatorial Tiling for Sparse Neural Networks. 2020 IEEE High Performance Extreme Computing (virtual conference), Sep 2020, Waltham, MA, United States. ⟨hal-02910997v3⟩
302 View
517 Download


Gmail Mastodon Facebook X LinkedIn More