A VLSI architecture for concurrent data structures
A VLSI architecture for concurrent data structures
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Optimal communication algorithms for regular decompositions on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Piriform (Olfactory) cortex model on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Optimal communication algorithms for regular decompositions on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Piriform (Olfactory) cortex model on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Neural networks and dynamic complex systems
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
| Hi-index | 0.00 |
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.