首页> 外国专利> Processor allocation method and apparatus for multiprocessor execution of a constraint satisfaction search

Processor allocation method and apparatus for multiprocessor execution of a constraint satisfaction search

机译:用于多处理器执行约束满足搜索的处理器分配方法和装置

摘要

Apparatus and method for minimizing, in a multiprocessor system, a variance in a search effort along different subtrees of a backtrack search tree employed for solving an instance of a constraint- satisfaction problem. A method includes the steps of (a) estimating an amount of search effort required for different subtrees of the search tree, (b) allocating an appropriate number of processors to each of the different subtrees of the search tree based upon the estimated amount of search effort, the number of processor allocated to each of the subtrees being selected to minimize a variance in search processing time along the different subtrees, and (c) executing the search with the allocated processors in parallel along the different subtrees of the search tree. The step of allocating an appropriate number of processors includes the steps of (a) dividing the search tree into N( M) subspaces and (b) assigning the M processors to the subspaces in proportion to the estimated effort involved in searching the subspaces.
机译:用于在多处理器系统中最小化沿着用于解决约束满足问题的实例的回溯搜索树的不同子树的搜索努力的方差的设备和方法。一种方法包括以下步骤:(a)估计搜索树的不同子树所需的搜索工作量;(b)根据估计的搜索量为搜索树的每个不同子树分配适当数量的处理器努力,选择分配给每个子树的处理器数量以最小化沿着不同子树的搜索处理时间的差异,以及(c)使用分配的处理器沿着搜索树的不同子树并行执行搜索。分配适当数量的处理器的步骤包括以下步骤:(a)将搜索树划分为N(

著录项

  • 公开/公告号US5146540A

    专利类型

  • 公开/公告日1992-09-08

    原文格式PDF

  • 申请/专利权人 INTERNATIONAL BUSINESS MACHINES CORP.;

    申请/专利号US19910815634

  • 发明设计人 KADATHUR S. NATARAJAN;

    申请日1991-12-30

  • 分类号G06F15/18;

  • 国家 US

  • 入库时间 2022-08-22 05:22:17

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号