非Hamilton基图光转置互连系统的容错性和Hamilton性
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
摘要:
哈密顿性是并行和分布式计算中的一个重要性质。哈密尔顿圈的存在使得分布式算法在网络上的有效仿真成为可能,无论这种算法存在于线性阵列还是环形网络中,并且可以保证分层互连网络中某些路由算法的无死锁性。Hamilton性还可以用于构造独立的生成树,并导致设计容错协议。光转置互连系统或OTIS(也称为两级交换网络)是一种被广泛研究的互连网络拓扑,其由于高度的可扩展性、规则性、模块化和封装能力而流行。令人惊讶的是,据我们所知,只有一个强有力的结果是已知的哈密尔顿性OTIS -显示哈密尔顿基图的OTIS图是哈密尔顿。在这项工作中,我们考虑了OTIS网络的哈密顿性,建立在非哈密顿基础上,并回答了一些重要的问题。首先,我们证明了基图的哈密尔顿性不是OTIS是哈密尔顿的必要条件。本文提出了一类由非Hamilton基图构成的Hamilton OTIS图。进一步证明了基图有Hamilton路并不足以使在其上构造的OTIS是Hamilton的。我们给出了一个大家族的Butterfly-OTIS的Hamilton性的建设性证明。这一证明导致了一个替代的有效算法独立的生成树建设这一类的OTIS图。我们的算法是线性的顶点数,而不是广义算法,这是线性的图的边数。
英文摘要:
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independent spanning tree and leads to designing fault tolerant protocols. Optical Transpose Interconnection Systems or OTIS (also referred to as two-level swapped network) is a widely studied interconnection network topology which is popular due to high degree of scalability, regularity, modularity and package ability. Surprisingly, to our knowledge, only one strong result is known regarding Hamiltonicity of OTIS - showing that OTIS graph built of Hamiltonian base graphs are Hamiltonian. In this work we consider Hamiltonicity of OTIS networks, built on Non-Hamiltonian base and answer some important questions. First, we prove that Hamiltonicity of base graph is not a necessary condition for the OTIS to be Hamiltonian. We present an infinite family of Hamiltonian OTIS graphs composed on Non-Hamiltonian base graphs. We further show that, it is not sufficient for the base graph to have Hamiltonian path for the OTIS constructed on it to be Hamiltonian. We give constructive proof of Hamiltonicity for a large family of Butterfly-OTIS. This proof leads to an alternate efficient algorithm for independent spanning trees construction on this class of OTIS graphs. Our algorithm is linear in the number of vertices as opposed to the generalized algorithm, which is linear in the number of edges of the graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。