English
Related papers

Related papers: The $h$-edge tolerable diagnosability of balanced …

200 papers

System level diagnosis is an important approach for the fault diagnosis of multiprocessor systems. In system level diagnosis, diagnosability is an important measure of the diagnosis capability of interconnection networks. But as a measure,…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-19 Qiang Zhu , Lili Li , Sanyang Liu , Xing Zhang

Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$-edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty links. This kind of diagnosability is a generalization of…

Combinatorics · Mathematics 2020-12-22 Yulong Wei , Rong-hua Li , Weihua Yang

Fault diagnosis is important to the design and maintenance of large multiprocessor systems. PMC model is the most famous diagnosis model in the system level diagnosis of multiprocessor systems. Under the PMC model, only node faults are…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-20 Qiang Zhu

In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two different diagnosis strategies: the precise diagnosis strategy…

Networking and Internet Architecture · Computer Science 2007-05-23 Guey-Yun Chang , Gerard J. Chang , Gen-Huey Chen

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. R.X. Hao et al. $(2014)$ \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in $BH_n$ with $(2n-2)$ faulty edges. D.Q.…

Combinatorics · Mathematics 2017-05-22 Pingshan Li , Min Xu

Aims: Try to prove the $n$-dimensional balanced hypercube $BH_n$ is $(2n-2)$-fault-tolerant-prescribed hamiltonian laceability. Methods: Prove it by induction on $n$. It is known that the assertation holds for $n\in\{1,2\}$. Assume it holds…

Combinatorics · Mathematics 2022-07-27 Ningning Song , Yuxing Yang

As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis is the process of identifying faulty processors in a…

Combinatorics · Mathematics 2012-04-20 Shuming Zhou , Jian Wang , Xirong Xu , Jun-Ming Xu

The processor failures in a multiprocessor system have a negative impact on its distributed computing efficiency. Because of the rapid expansion of multiprocessor systems, the importance of fault diagnosis is becoming increasingly…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-16 Hongbin Zhuang , Wenzhong Guo , Xiaoyan Li , Ximeng Liu , Cheng-Kuan Lin

This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in a hypercube-like graph $G_n$ which contain several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes,…

Combinatorics · Mathematics 2012-12-21 Xiang-Jun Li , Jun-Ming Xu

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in $BH_n$ with each vertex incident to at…

Combinatorics · Mathematics 2017-01-13 Pingshan Li , Min Xu

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors.…

Information Theory · Computer Science 2017-08-08 Shiying Wang , Xiaolei Ma

Let $F_{v}$ (resp. $F_e$) be the set of faulty vertices (resp. faulty edges) in the $n$-dimensional balanced hypercube $BH_n$. Fault-tolerant Hamiltonian laceability in $BH_n$ with at most $2n-2$ faulty edges is obtained in [Inform. Sci.…

Combinatorics · Mathematics 2016-04-28 Mei-Mei Gu , Rong-Xia Hao

The $g$-extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464--473] determined the $3$-extra edge-connectivity of balanced hypercubes…

Combinatorics · Mathematics 2020-07-07 Yulong Wei , Rong-hua Li , Weihua Yang

As the scale of data centers continues to grow, there is an increasing demand for interconnection networks to resist malicious attacks. Hence, it is necessary to evaluate the reliability of networks under various fault patterns. The family…

Combinatorics · Mathematics 2025-03-19 Shuqian Cheng , Mingzu Zhang , Sun-Yuan Hsieh , Eddie Cheng

The balanced hypercube $BH_{n}$, a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most $4n-5$ faulty edges if each…

Combinatorics · Mathematics 2023-02-20 Ting Lan , Huazhong Lü

Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in…

Combinatorics · Mathematics 2025-10-29 Yali Sun , Mingzu Zhang , Xing Feng , Xing Yang

The exchanged hypercube $EH(s,t)$, proposed by Loh {\it et al.} [The exchanged hypercube, IEEE Transactions on Parallel and Distributed Systems 16 (9) (2005) 866-874], is obtained by removing edges from a hypercube $Q_{s+t+1}$. This paper…

Combinatorics · Mathematics 2012-11-19 Xiang-Jun Li , Jun-Ming Xu

Twisted hypercube-like networks (THLNs) are an important class of interconnection networks for parallel computing systems, which include most popular variants of the hypercubes, such as crossed cubes, M\"obius cubes, twisted cubes and…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-11-24 Qiang Dong , Hui Gao , Yan Fu , Xiaofan Yang

We explain how to combine holonomic quantum computation (HQC) with fault tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent…

Quantum Physics · Physics 2009-02-20 Ognyan Oreshkov , Todd A. Brun , Daniel A. Lidar

Let $G=(V, E)$ be a connected graph, a subset $S\subseteq V(G)$ is called an $R^{g}$-vertex-cut of $G$ if $G-F$ is disconnected and any vertex in $G-F$ has at least $g$ neighbours in $G-F$. The $R^{g}$-vertex-connectivity is the size of the…

Combinatorics · Mathematics 2018-12-04 Shu-Li Zhao , Rong-Xia Hao
‹ Prev 1 2 3 10 Next ›