• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Task allocation in the star graph
【24h】

Task allocation in the star graph

机译：星状图中的任务分配

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The star graph has been known as an attractive candidate for interconnecting a large number of processors. The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks. The paper proposes a new code, called star code (SC), to recognize available substars of the required size in the star graph. It is shown that task allocation based on the SC is statically optimal. The recognition ability of a given SC or a class of SC's is derived. The optimal number of SC's required for the complete substar recognition in an n-dimensional star is shown to be 2/sup n-2/.
机译：星形图被公认为是用于互连大量处理器的有吸引力的候选者。星型图的层次结构允许将其特殊子图（子星）分配给一系列传入任务，这些子图具有与原始图相同的拓扑特征。该论文提出了一种新的代码，称为星形代码（SC），以识别星形图中所需大小的可用子星形。结果表明，基于SC的任务分配是静态最优的。推导给定SC或一类SC的识别能力。完整的n维恒星识别所需的SC的最佳数量显示为2 / sup n-2 /。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号