Parallelization of algorithms for neural networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Di Martino, B. (1996). Parallelization of algorithms for neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1041, pp. 134–140). Springer Verlag. https://doi.org/10.1007/3-540-60902-4_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free