pith. sign in

arxiv: 1412.7580 · v3 · pith:XFUHDH6Cnew · submitted 2014-12-24 · 💻 cs.LG · cs.DC· cs.NE

Fast Convolutional Nets With fbfft: A GPU Performance Evaluation

classification 💻 cs.LG cs.DCcs.NE
keywords nvidiaconvolutionalconvolutionsfbfftimplementationperformanceconvolutioncufft
0
0 comments X
read the original abstract

We examine the performance profile of Convolutional Neural Network training on the current generation of NVIDIA Graphics Processing Units. We introduce two new Fast Fourier Transform convolution implementations: one based on NVIDIA's cuFFT library, and another based on a Facebook authored FFT implementation, fbfft, that provides significant speedups over cuFFT (over 1.5x) for whole CNNs. Both of these convolution implementations are available in open source, and are faster than NVIDIA's cuDNN implementation for many common convolutional layers (up to 23.5x for some synthetic kernel configurations). We discuss different performance regimes of convolutions, comparing areas where straightforward time domain convolutions outperform Fourier frequency domain convolutions. Details on algorithmic applications of NVIDIA GPU hardware specifics in the implementation of fbfft are also provided.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Indirect Convolution Algorithm

    cs.CV 2019-07 unverdicted novelty 7.0

    The Indirect Convolution algorithm avoids im2col by using an indirection buffer, reducing memory overhead proportionally to input channels and outperforming GEMM-based methods by up to 62% for convolutions requiring t...