ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES

被引：1
|
作者：
Stewart, Iain A. [1 ]
机构：
[1] Univ Durham, Sch Engn & Comp Sci, Sci Labs, S Rd, Durham DH1 3LE, England
来源：
PARALLEL PROCESSING LETTERS | 2012年 / 22卷 / 01期
基金：
英国工程与自然科学研究理事会;
关键词：
routing; computational complexity; k-ary n-cubes; hypercubes;
D O I：
10.1142/S012962641250003X
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links potentially usable by this routing algorithm as it attempts to route the packet. This gives rise to a naturally defined problem, parameterized by this routing algorithm, relating to whether a packet can be routed from a given source node to a given destination node in one of our interconnection networks in which there are (possibly exponentially many) faulty links. We show that there exist such problems that are PSPACE-complete (all are solvable in PSPACE) but that there are (existing and popular) routing algorithms for which the computational complexity of the corresponding problem is significantly easier (yet still computationally intractable).
引用
收藏
页数：13
相关论文
共 50 条
  • [1] A partial irregular-network routing on faulty k-ary n-cubes
    Koibuchi, Michihiro
    Yoshinaga, Tsutomu
    Nishimura, Yasuhiko
    [J]. INTERNATIONAL WORKSHOP ON INNOVATIVE ARCHITECTURE FOR FUTURE GENERATION HIGH PERFORMANCE PROCESSORS AND SYSTEMS, 2006, : 57 - 64
  • [2] Reliability assessment for k-ary n-cubes with faulty edges
    Li, Si-Yu
    Li, Xiang-Jun
    Ma, Meijie
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 190
  • [3] Adaptive wormhole routing in k-ary n-cubes
    Yang, CS
    Tsai, YM
    Chi, SL
    Shi, SSB
    [J]. PARALLEL COMPUTING, 1995, 21 (12) : 1925 - 1943
  • [4] Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
    Bae, MM
    Bose, B
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (10) : 1271 - 1284
  • [5] Embeddings of cycles, meshes and tori in faulty k-ary n-cubes
    Ashir, YA
    Stewart, IA
    [J]. 1997 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1997, : 429 - 435
  • [6] Hamiltonian path embeddings in conditional faulty k-ary n-cubes
    Wang, Shiying
    Zhang, Shurong
    Yang, Yuxing
    [J]. INFORMATION SCIENCES, 2014, 268 : 463 - 488
  • [7] Increasing the adaptivity of routing algorithms for k-ary n-cubes
    Baydal, E
    López, P
    Duato, J
    [J]. 10TH EUROMICRO WORKSHOP ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2002, : 455 - 462
  • [8] Augmented k-ary n-cubes
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. INFORMATION SCIENCES, 2011, 181 (01) : 239 - 256
  • [9] Embedding long paths in k-ary n-cubes with faulty nodes and links
    Stewart, Iain A.
    Xiang, Yonghong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (08) : 1071 - 1085
  • [10] Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
    Li, Jing
    Wang, Shiying
    Liu, Di
    Lin, Shangwei
    [J]. INFORMATION SCIENCES, 2011, 181 (11) : 2260 - 2267
12345