Optimizing neural networks on SIMD parallel computers

Parallel Computing

Volumn 31, Issue 1, 2005, Pages 97-115

  Di Blas, Andrea ^a   Jagota, Arun ^a   Hughey, Richard ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Combinatorial optimization; Hopfield neural networks; Maximum clique; Parallel programming models for irregular problems; Single Instruction multiple data parallel computer

Indexed keywords

DATA REDUCTION; INTERCONNECTION NETWORKS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; HOPFIELD NEURAL NETWORKS; MAXIMUM CLIQUE; PARALLEL PROGRAMMING MODELS FOR IRREGULAR PROBLEMS; SINGLE INSTRUCTION-MULTIPLE DATA PARALLEL COMPUTERS;

NEURAL NETWORKS;

EID: 14644400378     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2004.11.002     Document Type: Article

References (39)

1. F. Alizadeh, A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs, in: Second ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1998, pp. 188-194
2. R.B. Altman Pacific Symposium on Biocomputing 2001 2000 World Scientific London
3. D.H. Ballard, and M. Brown Computer Vision 1982 Prentice-Hall Englewood Cliffs, NJ
4. D.H. Ballard, P.C. Gardner, M.A. Srinivas, Graph problems and connectionist architecture, Technical Report, Department of Computer Science, University of Rochester, 1987
5. P. Berman, A. Pelc, Distributed fault diagnosis for multiprocessor systems, in: 20th Annual International Symposium on Fault-Tolerant Computing, 1990, pp. 340-346
6. A. Bertoni, P. Campanelli, and G. Grossi A neural algorithm for the maximum clique problem: Analysis, experiments and circuit implementation Algorithmica 33 1 2002 71 88
7. I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo The maximum clique problem Handbook of Combinatorial Optimization vol. 4 1999 Kluwer Academic Boston, MA
8. D. Dahle, J.D. Hirschberg, K. Karplus, H. Keller, E. Rice, D. Speck, D.H. Williams, R. Hughey, Kestrel: design of an 8-bit SIMD parallel processor, in: Seventeenth Conference on Advanced Research in VLSI, September 1997, pp. 145-162
9. A. Di Blas, and R. Hughey Explicit SIMD programming for asynchronous applications IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP2000) 2000 IEEE Computer Society Press Silver Spring, MD 258 267
10. A. Di Blas, A. Jagota, R. Hughey, Parallel implementations of optimizing neural networks, in: Proceedings of ANNIE 2000, November 2000, pp. 153-158
11. A. Di Blas, A. Jagota, and R. Hughey Energy function-based approaches to graph coloring IEEE Transactions on Neural Networks 13 January 2002 81 91
12. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
13. L. Grate, M. Diekhans, D. Dahle, and R. Hughey Sequence analysis with the Kestrel SIMD parallel processor R.B. Altman Pacific Symposium on Biocomputing 2001 2000 World Scientific London 263 274
14. J.D. Hirschberg, D.M. Dahle, K. Karplus, D. Speck, and R. Hughey Kestrel: a programmable array for sequence analysis Journal of VLSI Signal Processing 19 1998 115 126
15. Home page of The UCSC Kestrel Parallel Processor. < http://www.cse.ucsc.edu/research/kestrel >
16. Home page of Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). < http://dimacs.rutgers.edu >
17. J. Hopfield, and D. Tank Neural computation of decisions in optimization problems Biol. Cybern. 52 1985 141 152
18. R. Hughey Parallel hardware for sequence comparison and alignment CABIOS 12 6 1996 473 479
19. R. Hughey, and D.P. Lopresti B-SYS: A 470-processor programmable systolic array International Conference on Parallel Processing 1 Aug 1991 580 583
20. A. Jagota Optimization by reduction to maximum clique IEEE International Conference on Neural Networks March 1993 1526 1531
21. A. Jagota Approximating maximum clique with a Hopfield network IEEE Transactions on Neural Networks 6 May 1995 724 735
22. A. Jagota An adaptive, multiple restarts neural network algorithm for graph coloring European Journal of Operational Research 93 1996 257 270
23. A. Jagota, L. Sanchis, and R. Ganesan Approximately solving maximum clique using neural network and related heuristics DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 1996 American Mathematical Society Providence RJ 169 204
24. D.E. Knuth, The sandwich theorem, Electronic Journal of Combinatorics, vol. 1, 1994 (Article 1, approx. 48pp, electronic)
25. F. Lin, K. Lee, A parallel computation network for the maximum clique problem, in: 1st International Conference on Fuzzy Theory Technical, October 1992
26. W. Lin, V.K. Prasanna, and K.W. Przytula Algorithmic mapping of neural network models onto parallel SIMD machines IEEE Transactions on Computers 40 Dec 1991 1390 1401
27. M. Misra Parallel environments for implementing neural networks Neural Computing Surveys 1 1997 46 80
28. J.R. Nickolls, The design of the Maspar MP-1: a cost effective massively parallel computer, in: COMPCON Spring 1990, February 1990, IEEE Computer Society Press, Silver Spring, MD, pp. 25-28
29. P. Pardalos, J. Rappe, and M. Resende An exact parallel algorithm for the maximum clique problem P.P.R. De Leone A. Murl'i G. Toraldo High Performance Algorithms and Software in Nonlinear Optimization 1998 Kluwer Dordrecht
30. L. Prechelt Exploiting domain-specific properties: compiling parallel dynamic neural network algorithms into efficient code IEEE Transactions on Parallel and Distributed Systems 10 Nov 1999 1105 1117
31. J. Ramanujam, and P. Sadayappan Optimization by neural networks International Conference on Neural Networks 2 1988 325 332
32. V.N. Rao, and V. Kumar On the efficiency of parallel backtracking IEEE Transactions on Parallel and Distributed Systems 4 April 1993 427 437
33. E. Rice, R. Hughey, Molecular fingerprinting on the SIMD parallel processor Kestrel, in: R.B. Altman et al., (Eds.), Pacific Symposium on Biocomputing 2001, World Scientific, London, 2000, pp. 323-334
34. Y. Shinano, T. Fujie, Y. Ikebe, R. Hirabayashi, Solving the maximum clique problem using PUBB, in: International Parallel Processing Symposium and Symposium on Parallel and Distributed Systems (IPPS/SPDP), pp. 326-332, IEEE, New York, 1998
35. W. Shu, and M. Wu Asynchronous problems on SIMD parallel computers IEEE Transactions on Parallel and Distributed Systems 6 July 1995 704 713
36. K. Smith Neural networks for combinatorial optimization: a review of more than a decade of research INFORMS Journal on Computing 11 1 1999 15 34
37. T.F. Smith, and M.S. Waterman Identification of common molecular subsequences J. Mol. Biol. 147 1981 195 197
38. M. Vingron, and P. Pevzner Motif recognition and alignment for many sequences by comparison of dot matrices J. Mol. Biol. 218 1991 33 43
39. M. Wu, and W. Shu MIMD programs on SIMD architectures The Sixth Symposium on the Frontiers of Massively Parallel Computation 11 October 1996 162 170