DECOMPOSITION AND MAPPING OF LOCALLY CONNECTED LAYERED NEURAL NETWORKS ON MESSAGE-PASSING MULTIPROCESSORS
- 1 January 1993
- journal article
- research article
- Published by Taylor & Francis in Parallel Algorithms and Applications
- Vol. 1 (1) , 43-56
- https://doi.org/10.1080/10637199308915430
Abstract
In this paper we present an integrated model for decomposition and mapping (D&M) of Locally Connected Layered Neural Networks (LCLNs) on message-passing multiprocessors. Within the framework of this model we analyze two previously proposed D&M strategies for a particular class of LCLNs. The model is compared with the performance of a neural network simulation environment, running on a transputer array. We find that both strategies may be applicable, depending on the network size, and we can determine the problem size at which one strategy is preferred over the other. Furthermore, we find that the regularity of the communication pattern between the processors is an unexpected factor in the D&M decision.Keywords
This publication has 8 references indexed in Scilit:
- Parallel implementation and capabilities of entropy-driven artificial neural networksJournal of Parallel and Distributed Computing, 1992
- Load Balancing Grid-Oriented Applications on Distributed Memory Parallel ComputersPublished by Springer Nature ,1992
- Performance of dynamic load balancing algorithms for unstructured mesh calculationsConcurrency: Practice and Experience, 1991
- Simulating modular neural networks on message-passing multiprocessorsParallel Computing, 1991
- Mapping parallel programs to multiprocessors: A dynamic approachParallel Computing, 1989
- Mapping strategies in message-based multiprocessor systemsParallel Computing, 1989
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- On the Mapping ProblemIEEE Transactions on Computers, 1981