返回
A highly efficient implementation of a backpropagation learning algorithm using matrix ISA
DOI:10.1016/j.jpdc.2007.12.004.png)
摘要
En 中文
BackPropagation (BP) is the most famous learning algorithm for Artificial Neural Networks (ANN). BP has received intensive research efforts to exploit its parallelism in order to reduce the training time for complex problems. A modified version of BP based on matrix-matrix multiplication was proposed for parallel processing. In this paper, we present the implementation of Matrix BackPropagation (MBP) using scalar, vector, and matrix Instruction Set Architectures (ISAs). Besides this, we show that the performance of the MBP is improved by switching from scalar ISA to vector ISA. It is further improved by switching from vector ISA to matrix ISA. On a practical application, speech recognition, the speedup of training a neural network using unrolling scalar ISA over scalar ISA is 1.83. On eight parallel lanes, the speedups of using vector, unrolling vector, and matrix ISAs are respectively 10.33, 11.88, and 15.36, where the maximum theoretical speedup is 16. The results obtained show that the use of matrix ISA gives a performance close to optimal, because of reusing the loaded data, decreasing the loop overhead, and overlapping the memory operations with arithmetic operations. (c) 2008 Elsevier Inc. All rights reserved.
Keyword:
neural networks
parallel architecture
vector/matrix processing
parallel algorithms
backpropagation algorithm
reusing data
loop unrolling
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Enzymology with a Spin-Labeled Phospholipase C: Soluble Substrate Binding by 31P NMR from 0.005 to 11.7 T具有自旋标记的磷脂酶C的酶学: 通过 31P NMR从0.005到11.7 T的可溶性底物结合
Biochemistry
IF0

