A Scalable Parallel Formulation of the Backpropagation Algorithm for
Hypercubes and Related Architectures
ABSTRACT
In this paper, we present a new technique for mapping the backpropagation
algorithm on hypercubes and related architectures. A key component of
this technique is a network partitioning scheme which is called
checkerboarding. Checkerboarding allows us to replace the all-to-all
broadcast operation performed by the commonly used vertical network
partitioning scheme, with operations that are much faster on the
hypercubes and related archictures. Checkerboarding can be combined with
the pattern partitioning technique to form a hybrid scheme which performs
better than either one of these schemes. Theoretical analysis and
experimental results on nCUBE2
and CM5 show that our scheme performs better than the other
schemes, both for uniform and non-uniform networks.
nCUBE2 is a trademark of the Ncube corporation
CM5 is a trademark of the Thinking Machines corporation
Keywords:
Please select the format you would like to view the paper
If your browser do not support the viewing of postscript file, it
will save as a file instead
![[HOME PAGE]](/research/shashi-group/home_btn.gif)
Design and Maintain by Julian Chow
Questions and Comments?
![[mailto:]](/research/shashi-group/icons/icnmail2.gif)
jchow@cs.umn.edu
[last Updated] Tue. July 25th 1995