Abstract
In this paper we present the strategies adopted in the parallelization of two algorithms for the simulation of two classes of neural networks: the Hopfield Network and the Error BackPropagation Network.
Although the parallel algorithms have been developed within the (loosely synchronous) SPMD parallel programming model, the particular nature of the strategies adopted make the final parallel algorithms not expressible within the HPF-like programming paradigm; therefore a more flexible programming model, the message passing programming paradigm, has been adopted, and the final development has been carried out in the PVM environment.
This work has been supported in part by the Italian Ministry of University and Scientific and Technological Research within the “40%” Project.
Preview
Unable to display preview. Download preview PDF.
References
R.H.Nielsen, Neurocomputing, Addison-Wesley.
J. N. Magee and S. C. Cheung, “Parallel Algorithm Design for Workstation clusters”, Software — Practice and Experience, 21(3), pp. 235–250, Mar. 1991.
A. H. Karp, “Programming for Parallelism”, IEEE Computer,20, pp. 43–57, May 1987.
J.R. Westlake, A handbook of numerical matrix inversion and solution of linear equations, Wiley, New York, 1968.
A. Geist V.S.Sunderam, “Network-Based concurrent computing on the PVM system”, Concurrency: practice and experience, vol. 4, n. 4, pp. 293–311, Jun 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Martino, B. (1996). Parallelization of algorithms for neural networks. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science. PARA 1995. Lecture Notes in Computer Science, vol 1041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60902-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-60902-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60902-5
Online ISBN: 978-3-540-49670-0
eBook Packages: Springer Book Archive