A Study of Vertex-Fault-Tolerant Cycles Embedding in Conditionally Faulty Folded Hypercube Network Topologies

• Main Authors: Yang, Shun-Kuang, 楊舜光
• Other Authors: Kuo, Che-Nan
• Format: Others
• Language: zh-TW
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/3g3g97

碩士 === 稻江科技暨管理學院 === 動畫遊戲設計學系碩士班 === 106 === Design of interconnection networks is an important integral part of the parallel processing or distributed system. Cycles, which are one of the most fundamental networks for parallel and distributed computation, are suitable for designing simple algorithms with low communication costs. Cycles can also be used as control/data flow structures for distributed computation in arbitrary networks. Many efficient algorithms were originally designed based on cycles for solving a variety of algebraic problems, graph problems or some parallel applications. A network is said to be conditionally faulty if its every vertex has at least g fault-free neighbors, where g>=1. In this thesis, we define that a network is g-conditionally faulty if its every vertex has at least g fault-free neighbors. Then, under the 4-conditionally faulty, we consider the fault-tolerant various cycles embedding properties in folded hypercubes FQ_n. Let FF_v denotes the set of faulty vertices in FQ_n. It has been shown the following two properties as that: Property 1: FQ_n-FF_v contains a fault-free cycle of every even length from 4 to 2^n-2|FF_v| if |FF_v|<=2n-5, where n>=3; Property 2: FQ_n-FF_v contains a fault-free cycle of every odd length from n+1 to 2^n-2|FF_v|-1 if |FF_v|<=2n-5, where n>=4 and n is even.