Hierarchical hypercubes
WebThis paper shows that the largest connected component of the survival graph contains almost all remaining vertices in the hierarchical hypercube HHC n when the … 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 …
Hierarchical hypercubes
Did you know?
http://staff.ustc.edu.cn/~xujm/201212.pdf WebAs a result, we can readily use any of the low-latency scalable networks, such as meshes or hypercubes, that were originally developed for message-passing machines 1771. While the design of bus-based snoopy coherence protocols is reasonably well understood, this is not true of distributed directory-based protocols.
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 … WebReliability Assessment of Hierarchical Hypercube Networks Abstract: The g-good neighbor connectivity κ g (G) and g-good-neighbor diagnosability t g (G) are two important …
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 ...
WebAs applications, the component diagnosability is explored for some well-known networks, including complete cubic networks, hierarchical cubic networks, generalized exchanged hypercubes, dual-cube-like networks, hierarchical hypercubes, Cayley graphs generated by transposition trees (except star graphs), and DQcube as well.
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 doi 10.1136/bmj.h2723WebAbstract: 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 ... doi 10.1136/bmj.h4978Web20 de dez. de 2002 · Abstract: Hierarchical hypercubes, such as extended hypercube (EH), hyperweave (HW), and extended hypercube with cross connections (EHC), have … doi 10.1136/bmj.h4672Web18 de fev. de 2015 · As applications, the non-inclusive diagnosabilities of hypercubes, hierarchical hypercubes, folded hypercubes, star graphs, bubble-sort graphs, pancake graphs and dual cubes are determined under ... doi 10.1136/bmj.h3942Web1 de jan. de 1994 · Thispaper introduces a new interconnection topology that is called the hierarchical hypercube(HHC). ... "Incomplete hypercubes," IEEE Trans. Comput., vol. … doi 10.1136/bmj.h5000Web16 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 … doi 10.1136/bmj.h4451WebA new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, … doi 10.1136/bmj.h56