A (4n − 9)/3 diagnosis algorithm for generalised cube networks

DOI10.1080/17445760903225700zbMath1214.68058OpenAlexW2047736902MaRDI QIDQ3563367

Amiya Nayak, Hui Yang, Xiaofan Yang

Publication date: 31 May 2010

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760903225700

zbMATH Keywords

multiprocessor systemdiagnosis algorithmsystem-level diagnosis\(t/k\)-diagnosisgeneralised cube network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK

Cites Work

• Minimum neighborhood in a generalized cube
• A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
• Hamiltonian properties on the class of hypercube-like networks
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• On Fault Isolation and Identification in t₁/t₁-Diagnosable Systems
• A group-theoretic model for symmetric interconnection networks
• The Mobius cubes
• On diagnosability of large fault sets in regular topology-based computer systems
• The locally twisted cubes
• On the maximal connected component of hypercube with faulty vertices

This page was built for publication: A (4n − 9)/3 diagnosis algorithm for generalised cube networks