Published January 1988
| public
Book Section - Chapter
Hypercube algorithms for neural network simulation: the Crystal_Accumulator and the Crystal_Router
- Creators
- Fox, G. C.
- Furmanski, W.
- Other:
- Fox, Geoffrey
Abstract
We discuss communication algorithms relevant for neural network modeling on distributed memory concurrent computers with a hypercube topology. Full, intermediate (medium range) and sparse network connectivities are analyzed. We point out that the flexible hypercube topology allows for the efficient implementation of the broad class of network algorithms with variety of connectivity patterns. We find algorithms index, crystal_router, fold and crystal_ accumulator which are appropriate in different cases depending on the sparseness and regularity of the network interconnect. We show that there are natural analogies between biological communication paths and the interconnects of a distributed memory concurrent computer.
Additional Information
© 1988 ACM. Work supported in part by DOE grant DE-FG03-85ER25009, the Program Manager of the Joint Tactical Fusion Office, and the ESD division of the USAF, as well as grants from IBM, and SANDIA.Additional details
- Eprint ID
- 71406
- DOI
- 10.1145/62297.62390
- Resolver ID
- CaltechAUTHORS:20161024-151051261
- DE-FG03-85ER25009
- Department of Energy (DOE)
- Joint Tactical Fusion Office
- U.S. Air Force
- IBM
- Sandia National Laboratories
- Created
-
2016-10-24Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field