首页> 外文OA文献 >Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine
【2h】

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

机译:Kanerva的稀疏分布式内存:一种非常适合Connection Machine的关联内存算法

摘要

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.
机译:连接机的问世深刻地改变了超级计算机的世界。高度非传统的体系结构使得探索标准Von Neumann体系结构不可行的算法成为可能。稀疏分布式内存(SDM)是这种算法的一个示例。稀疏的分布式内存是关联内存的一种特别简单而优雅的表述。描述了稀疏分布式内存的基础,并提供了一些使用内存的简单示例。稀疏分布内存与三个重要的计算系统之间的关系如图所示:随机存取内存,神经网络和大脑小脑。最后,讨论了连接机上稀疏分布式内存算法的实现。

著录项

  • 作者

    Rogers David;

  • 作者单位
  • 年度 1988
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号