Hierarchical hypercubes
WebInside a (2 m + m)-dimensional HHC, we shall describe an algorithm that can find disjoint paths between a source node and at most m + 1 destination nodes of maximum length … Web18 de dez. de 2024 · These graphs can be used in NoC directly or, combining with hierarchical method or Cartesian products, used as the interconnects for clusters. Symmetry, as one of the important properties for graph filtering, is also an essential factor in characterizing and measuring complex networks [ 14 , 15 ] as demonstrated in Conder [ …
Hierarchical hypercubes
Did you know?
Web5 de jan. de 2012 · The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. An HHC can connect many nodes while r. ... The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes, The Computer Journal, Volume 55, Issue 6, June 2012, Pages 769–775, ... Web1 de abr. de 2024 · The hierarchical hypercubes are a (m + 1)-regular bipartite graph of 2 n vertices, where n = 2 m + m. Any two vertices of H H C n have at most two common neighbors. Theorem 4.18 [19] For the hierarchical hypercube networks H H C n with n ...
Web10 de nov. de 1996 · The hierarchical cubic network (HCN), which takes hypercubes as basic clusters, was first introduced in [6]. Compared with the hypercube of the same size, the HCN requires only about half the number of links and provides a lower diameter. Web16 de dez. de 2012 · Hypercubes are a simple topology frequently used as interconnection network of parallel systems. However, hypercubes connecting a significant number of nodes also have an impractically high number of edges. To address this issue, Ghose and Desai introduced a new topology, hierarchical cubic networks, containing almost half …
Web1 de jan. de 2011 · Available online at www.sciencedirect.com Procedia Computer Science 4 (2011) 442–451 International Conference on Computational Science, ICCS 2011 Node-to-set disjoint-path routing in perfect hierarchical hypercubes Antoine Bossarda,1,∗, Keiichi Kanekoa, Shietung Pengb aTokyo University of Agriculture and Technology … WebAbstract: The g-good neighbor connectivity κ g (G) and g-good-neighbor diagnosability t g (G) are two important parameters to evaluate the reliability and fault tolerance for an interconnection network G. So far, almost all known results about κ g (G) and t g (G) are about special g except the hypercubes, the star graphs, the k-ary n-cubes ...
Web9 de jun. de 2024 · Bossard A, Kaneko K, Peng S (2011) A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes. Comput J 54(8):1372–1381. Article Google Scholar Bossard A, Kaneko K, Peng S (2011) Node-to-set disjoint-path routing in perfect hierarchical hypercubes. Procedia Comput Sci 4:442–451
WebA new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same … ruby search stringhttp://www.joca.cn/EN/10.11772/j.issn.1001-9081.2024030414 scanner take reader as arghttp://scst.suda.edu.cn/10/cb/c11250a528587/page.htm scanner taking string inputWeb20 de dez. de 2002 · Abstract: Hierarchical hypercubes, such as extended hypercube (EH), hyperweave (HW), and extended hypercube with cross connections (EHC), have … ruby seasoning recipeWeb10 de nov. de 1996 · The hierarchical cubic network (HCN) has been proposed and analyzed by Ghose and Desai in [8-101. The HCN takes hypercubes as basic clusters, which are connected in a complete manner. An HCN that consists of 2 basic clusters - each of which is an n-cube - is referred to as HCN (n,n). Compared with the hypercube of the … scanner takes long to send scanWeb15 de set. de 1996 · In this paper, we propose a hierarchical interconnection network based on hypercubes called hierarchical hypercube network (HHN) for massively … ruby season 1Web1 de jan. de 1986 · Hayes et al. used hypercube architecture to implement supercomputers [1], Nieminen et al. described pseudocubes using hypercubes , ... Hierarchical extended Fibonacci cubes HEFC1(n) ... ruby season 9