Mapping Sequential Processing Algorithms Onto Parallel Distributed Processing Architectures

Rodney Clark; Charles Hester; Perry Lindberg

doi:10.1117/12.944029

20 April 1988 Mapping Sequential Processing Algorithms Onto Parallel Distributed Processing Architectures

Rodney Clark, Charles Hester, Perry Lindberg

Author Affiliations +

Proceedings Volume 0880, High Speed Computing; (1988) https://doi.org/10.1117/12.944029
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States

Abstract

Teledyne Brown Engineering has developed techniques for mapping sequential algorithms onto a neural model of a parallel distributed processor. Any sequential algorithm (including NP algorithms) can be mapped onto a neural network. This paper discusses some practical considerations for implementation of sequential to parallel mappings (SPM). It is feasible to generalize these techniques and implement a neural compiler for sequential algorithms. Neural networks (the interconnection matrix) generated by the neural compiler will be implemented in a fixed, holographic, optical computer.

Citation Download Citation

Rodney Clark, Charles Hester, and Perry Lindberg "Mapping Sequential Processing Algorithms Onto Parallel Distributed Processing Architectures", Proc. SPIE 0880, High Speed Computing, (20 April 1988); https://doi.org/10.1117/12.944029

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE