k-ary n-cube network: Modeling, topological properties and routing strategies

被引:0
|
作者
Department of Computer Science, Queens College of the CUNY, Flushing, NY 11367, United States [1 ]
机构
来源
Comput Electr Eng | / 3卷 / 155-168期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
18
引用
收藏
相关论文
共 50 条
  • [21] The conditional node connectivity of the k-ary n-cube
    Day, K
    Harous, S
    Al-Ayyoub, AE
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOL VI, PROCEEDINGS, 1999, : 2706 - 2710
  • [22] Characterization of deadlocks in k-ary n-cube networks
    Pinkston, TM
    Warnakulasuriya, S
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (09) : 904 - 921
  • [23] Enhanced OTIS k-ary n-cube networks
    Das, Rajib K.
    Distributed Computing and Internet Technology, Proceedings, 2006, 4317 : 200 - 211
  • [24] Immucube:: Scalable fault-tolerant routing for k-ary n-cube networks
    Puente, Valentin
    Gregorio, Jose Angel
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (06) : 776 - 788
  • [25] Analysis of fault-tolerant routing algorithms in k-ary n-cube networks
    Al-Sadi, J
    Day, K
    Ould-Khaoua, M
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2003, 18 (02): : 79 - 85
  • [26] THE IMPACT OF PIPELINED CHANNELS ON K-ARY N-CUBE NETWORKS
    SCOTT, SL
    GOODMAN, JR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (01) : 2 - 16
  • [27] THE INDIRECT K-ARY N-CUBE FOR A VECTOR PROCESSING ENVIRONMENT
    BROOKS, ED
    PARALLEL COMPUTING, 1988, 6 (03) : 339 - 348
  • [28] Structure fault tolerance of k-ary n-cube networks
    Miao, Lu
    Zhang, Shurong
    Li, Rong-hua
    Yang, Weihua
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 213 - 218
  • [29] The 3-path-connectivity of the k-ary n-cube
    Zhu, Wen -Han
    Hao, Rong-Xia
    Feng, Yan-Quan
    Lee, Jaeun
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 436
  • [30] Communication algorithms in k-ary n-cube interconnection networks
    Ashir, Y
    Stewart, IA
    Ahmed, A
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 43 - 48