By Topic

Algorithmic mapping of neural network models onto parallel SIMD machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lin, W.-M. ; Dept. of Electr. & Comput. Eng., Mississippi State Univ., MS, USA ; Prasanna, V.K. ; Przytula, K.W.

Implementations of neural networks on programmable massively parallel computers are addressed. The methods are based on a graph theoretic approach and are applicable to a large class of networks in which the computations can be described by means of matrix and vector operations. A detailed characterization of the target machine is provided. Two mappings are presented. The first is designed for a processor array consisting of a very large number of small processing units. The neurons and the nonzero synaptic weights are assigned to the processors in a predetermined order, one per processor. The data transfers between processors containing neurons and weights are implemented using a novel routing algorithm. The second mapping is designed for the data array of size N×N and a smaller processor array of size P×P, PN, i.e., it addresses the partitioned case. These mappings are applicable to most of the mesh-connected single-instruction-multiple-data (SIMD) machines

Published in:

Computers, IEEE Transactions on  (Volume:40 ,  Issue: 12 )