Loading...
Please wait, while we are loading the content...
Kanerva's sparse distributed memory: an associative memory algorithm well-suited to the connection machine
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Rogers, David |
| Copyright Year | 1988 |
| Description | The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed. |
| File Size | 1020465 |
| Page Count | 21 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19890017031 |
| Archival Resource Key | ark:/13960/t0xq1wn7f |
| Language | English |
| Publisher Date | 1988-11-01 |
| Access Restriction | Open |
| Subject Keyword | Computer Operations And Hardware Cerebellum Algorithms Neural Nets Random Access Memory Supercomputers Memory Computers Parallel Processing Computers Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
