计算机应用 ›› 2005, Vol. 25 ›› Issue (09): 2111-2113.DOI: 10.3724/SP.J.1087.2005.02111

• 网络与信息安全 • 上一篇    下一篇

基于Hypercube的最长导出路算法

邱成功,马英红,任晓慧   

  1. 山东师范大学信息管理学院
  • 出版日期:2005-09-01 发布日期:2011-04-11
  • 基金资助:

    国家自然科学基金资助项目(NSFC10471078)

Algorithm for the longest induced path in Hypercube

QIU Cheng-gong,MA Ying-hong,REN Xiao-hui   

  1. College of Information Management,Shandong Normal University,Ji’nan Shandong 250014,China
  • Online:2005-09-01 Published:2011-04-11

摘要: 超立方体(Hypercube)网络是多处理机系统中常见的一种互连网络。文中提出Hypercube中最长导出路的概念,然后给出一种能改善多处理机系统中传输容错性的最长导出路算法,最后给出该算法的C++实现。

关键词: 超立方体, 容错, 多处理机系统, C++

Abstract: Hypercube network is a kind of common interconnection network.The definition of the longest induced path(the LIP) in hypercube was proposed with an algorithm for the LIP which could improve the performance of the fault-tolerance in multiprocessors.In the end,the realization of the algorithm using the language(C++) was given.

Key words: Hypercube, fault-tolerance, multiprocessors, C++

中图分类号: