A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs

With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. In addition, the algorithms should tolerate cluster faults instead of a single fault for actual operation. In this paper, we assumed n−1−k cluster faults in an n-pancake graph, which is promising for a topology of interconnection networks and we developed a cluster-fault-tolerant routing algorithm that constructs disjoint paths from one node to k distinct nodes. The maximum length of the paths given by the algorithm is 2n + 3, and the time complexity to construct the paths is O(kn2 ).

• Type: Conference
• Year: 2007
• Where: ISCAPDCS
• Authors: Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
• Keywords: Algorithm, Cluster Faults, Distributed And Parallel Computing, ISCAPDCS 2007, Parallel Computation Systems