• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议> >An approach for parallelizing OPS5 production systems and a faster match, C based indexing scheme for hypercube machines
【24h】

An approach for parallelizing OPS5 production systems and a faster match, C based indexing scheme for hypercube machines

机译：一种用于并行化OPS5生产系统的方法以及一种针对超立方体机器的更快匹配，基于C的索引方案

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

An algorithm for reducing the amount of time spent by a production system in its MATCH phase is presented. The algorithm utilizes C language's arithmetic operations, which are not efficiently computed in standard production system languages, and also constricts the activity of the MATCH phase as performed in the OPS5 programming language. The parallelization is achieved by distributing the search amongst the nodes of a hypercube. The MATCH phase is an effort to satisfy the LHS (left hand side) of a PR (production rule) by the contents of a WM (working memory). C programming language was used for the implementation of the monkey-and-banana problem written in OPS5.
机译：提出了一种用于减少生产系统在其MATCH阶段花费的时间的算法。该算法利用了C语言的算术运算，这些运算在标准生产系统语言中无法有效地计算出来，并且还限制了以OPS5编程语言执行的MATCH阶段的活动。通过在超立方体的节点之间分布搜索来实现并行化。 MATCH阶段是通过WM（工作存储器）的内容来满足PR（生产规则）的LHS（左侧）的工作。使用C编程语言来实现用OPS5编写的猴子和香蕉问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号