期刊文献+

带有丢失弧的双向超立方体网络的诊断度

The Diagnosability of Bidirectional Hypercube Networks with Missing Links
在线阅读 下载PDF
导出
摘要 超立方体因其特殊的结构和良好的性质成为多处理机系统最常用的互联网络之一.在实际的超立方体网络中两个处理器间的双向连接常常是通过两个方向相反的单向信道物理实现的.诊断度是度量系统识别故障能力的指标,而PMC模型是一种基于测试的系统级故障诊断模型.研究了当丢失一些单向信道时双向超立方体网络在PMC模型下的诊断度并确定了具有特定诊断度的双向超立方体所需的最小测试数. The hypercube is one of the most popular intereonnection networks for multiprocessor systems because of its special structure and good properties. In most hypereube multiprocessor architectures, each link is physically implemented by two opposite unidirectional channels. The diagnosability is an indicator for measuring the system' s ability to identify faults, while PMC model is a system level fault diagnosis model based on testing. The diagnosability of bidirectional hypereube networks with missing links under the PMC model is studied and the minimum number of tests in a bidirectional hypercube with a specific diagnosability is determined.
作者 张雯丽 林上为 景小飞 ZHANG Wenli;LIN Shangwei;JING Xiaofei(School of Mathematical Sciences,Shanxi University,Taiyuan 03006,China)
出处 《河南科学》 2018年第11期1684-1688,共5页 Henan Science
基金 国家自然科学基金(61202017)
关键词 网络 有向图 超立方体 诊断度 容错性 network digraph hypercube diagnosability fault tolerance
  • 相关文献

参考文献2

二级参考文献16

  • 1HELDON B,KRISHNAMURTHY B. A group-theoretic model for symmetric interconnection networks [ J ]. IEEE Transac- tion on Computer, 1989, 38(4) :555-566.
  • 2ZHU Q, GUO G G. Relating diagnosability, strong diagnosability and conditional diagnosability of strong networks [ J ].IEEE Transaction on Computer, 2014, 63 (7) : 1847-1851.
  • 3HONGW S, HSIEH S Y. Strong diagnosability and conditional diagnosability of augmented cubes under the comparison di- agnosis model[J]. IEEE Transaction on Reliability, 2012, 61 (1) :140-148.
  • 4FUJITA S. On oriented diameter of star graph[ C]//Proeeedings of 2013 First International Symposium on Computing and Networking, Matsuyama, Japan: 1EEE Press, 2013:48-56.
  • 5BETTAYEB S, CONG B, GIROU M,et al. Embedding star networks into hypercube [ J 1. IEEE Transaction on Computer, 1996, 45(2) 186-194.
  • 6HSIEH S Y, CHEN G H, HO C W. Longest fault free paths in star graphs with edge faults [J ] . IEEE Transaction on Com- puter, 2001, 50(9) :960-971.
  • 7HSIEH S Y. Embedding longest fault-free paths onto star graphs with more vertex faults [ J ]. Theoretical computer science, 2005, 337 ( l-3 ) :370-378.
  • 8PREPARATA F P, METZE G, CHIEN R T. On the connection assignment problem of diagnosable systems [ J]. IEEE Transaction on Electronic Computers, 1967, 16(12) :848-854.
  • 9BARSI F, GRANDONI F, MAESTRINII P. A Theory of diagnosability of digital systems [ J ]. IEEE Transaction on Com- puter, 1976, 25 (6) :585-593.
  • 10HSU G H, TAN J M. A local diagnosability measure for multiprocessor systems [ J ]. IEEE Transaction on Parallel and dis- tributed Systems, 2007, 18 (5) :598-607.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部