A fully data parallel WFST-based large vocabulary continuous speech recognition on a graphics processing unit

Citations Over TimeTop 10% of 2009 papers

Abstract

Tremendous compute throughput is becoming available in personal desktop and laptop systems through the use of graphics processing units (GPUs). However, exploiting this resource requires re-architecting an application to fit a data parallel programming model. The complex graph traversal routines in the inference process for large vocabulary continuous speech recognition (LVCSR) have been considered by many as unsuitable for extensive parallelization. We explore and demonstrate a fully data parallel implementation of a speech inference engine on NVIDIA’s GTX280 GPU. Our implementation consists of two phases compute-intensive observation probability computation phase and communication-intensive graph traversal phase. We take advantage of dynamic elimination of redundant computation in the compute-intensive phase while maintaining close-to-peak execution efficiency. We also demonstrate the importance of exploring application-level trade-offs in the communication-intensive graph traversal phase to adapt the algorithm to data parallel execution on GPUs. On 3.1 hours of speech data set, we achieve more than 11× speedup compared to a highly optimized sequential implementation on Intel Core i7 without sacrificing accuracy.

Related Papers

• → Basic Definitions and Network Traversal Algorithms(2013)8 cited
• → Exploring graph traversal algorithms in graph-based molecular generation(2021)1 cited
• Discovery of Frequent Traversal Patterns from Weighted Traversals and Performance Enhancement by Traversal Split(2007)
• → Exploring graph traversal algorithms in graph-based molecular generation(2021)
• → Exploring graph traversal algorithms in graph-based molecular generation(2021)