首页> 外国专利> Task allocation method and apparatus for hypercube multicomputer

Task allocation method and apparatus for hypercube multicomputer

机译:超立方体多计算机的任务分配方法和装置

摘要

The present invention is directed to performing the task modules to the processors to execute a parallel program having a task consisting of 2n task modules in a hypercube multicomputer consisting of 2n processors. A method and apparatus for allocating a task according to a mapping with one-to-one mapping, the first process of converting a task graph of the task into G *k and a graph G *k converted in the first process. A second process of dividing the Max Scott, a third process of forming a subset of the graph G according to the Max Scott calculated in the second process, and a k-th according to the subset formed in the third process And a fourth process of allocating bits to calculate mapping X to produce the task according to the mapping X at the lowest cost. And assigned to the document.
机译:本发明针对在由2n个处理器组成的超立方体多计算机中对处理器执行任务模块以执行具有由2n个任务模块组成的任务的并行程序。一种用于根据具有一对一映射的映射来分配任务的方法和装置,该第一过程将任务的任务图转换为G * k 在第一个过程中转换的图G * k 。划分Max Scott的第二步,根据第二步中计算出的Max Scott形成图G的子集的第三步以及根据第三步中形成的子集的第k次和分配比特以计算映射X,从而以最低的成本根据映射X产生任务。并分配给文件。

著录项

  • 公开/公告号KR950029969A

    专利类型

  • 公开/公告日1995-11-24

    原文格式PDF

  • 申请/专利权人 김광호;

    申请/专利号KR19940007735

  • 发明设计人 이철훈;

    申请日1994-04-13

  • 分类号G06F15/16;

  • 国家 KR

  • 入库时间 2022-08-22 03:46:15

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号