Referenced Items are not available for this document.
A parallel sparse matrix algorithm is proposed for the simulation of the modified Hopfield-Tank (MHT) network for solving the Traveling Salesman Problem (TSP). The MHT network using this sparse matrix algorithm has been implemented on a DAP-510, a massively parallel SIMD (single-instruction-steam, multiple-data-stream) computer consisting of 1024 processors. Problems of various sizes, ranging from eight cities up to 256 cities, have been simulated. The results show a very large speedup for the algorithm as compared with one using a standard dense matrix implementation
Published in:
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Date of Conference: 8-10 Oct 1990
- Page(s):
- 376 - 379
- Meeting Date :
- 08 Oct 1990-10 Oct 1990
- Print ISBN:
- 0-8186-2053-6
- INSPEC Accession Number:
- 3908250
- Conference Location :
- College Park, MD
- Digital Object Identifier :
- 10.1109/FMPC.1990.89486
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
