Title

Efficient Parallelizations Of A Competitive Learning Algorithm For Text Retrieval On The Maspar

Abstract

In this paper, we present parallel implementations of a connectionist model for text retrieval on the MasPar MP-1, a SIMD machine with up to 16 K processors. The connectionist model was originally developed on a SUN SparcStation 1+ for a sequential implementation. In our parallel implementations, we consider three strategies for mapping the network onto the MasPar: one-to-one, many-to-one, and one-to-many, depending on the ratio of the network size to the number of processors, in order to reduce the computation time. We also consider load balancing among processors for further improvement in performance. Our experimental results demonstrate noticeable speedups in our parallel implementations.

Publication Date

1-1-1995

Publication Title

Frontiers of Massively Parallel Computation - Conference Proceedings

Number of Pages

4-11

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0029196888 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029196888

This document is currently not available here.

Share

COinS