By Topic

Efficient implementation of connectionist models on MIMD parallel processors using chordal ring topologies

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)
Kamangar, F.A. ; Fort Worth Autom. Robotics Res. Inst., TX, USA ; Duderstadt, R.A. ; Smith, J.O.

Summary form only given, as follows. A systematic approach is presented for the implementation of connectionist models on message-passing parallel computers. The work concentrates on multiple-instruction multiple-data (MIMD) architectures with no global or shared memory. Information is transferred between processors by high-speed communication channels. Each processor has its own memory for storing both data and programs. Graph theory is used to find efficient topologies for partitioning a neural network while minimizing communications between processors. An efficient routing algorithm and methodology for problem decomposition are presented where the number of neurons and processors for computation may be specified by the user. Interprocessor communications are automatically established using an algorithm based on chordal ring graphs. Simulations of both backpropagation and Hopfield models have been conducted on an MIMD parallel computer with 32 processors.<>

Published in:

Neural Networks, 1989. IJCNN., International Joint Conference on

Date of Conference:

0-0 1989