8 research outputs found
The Nature Diagnosability of Bubble-sort Star Graphs under the PMC Model and MM Model
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. No fault set can contain all the neighbors of any fault-free vertex in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a famous topology structure of interconnection networks, the -dimensionalnbsp bubble-sort star graph nbsphas many good properties. In this paper, we prove that the nature diagnosability of nbspis nbspunder the PMC model for , the nature diagnosability of nbspis nbspunder the MM model for
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model
System diagnosis is process of identifying faulty nodes in a system. An
efficient diagnosis is crucial for a multiprocessor system. The BGM diagnosis
model is a modification of the PMC diagnosis model, which is a test-based
diagnosis. In this paper, we present a specific structure and propose an
algorithm for diagnosing a node in a system under the BGM model. We also give a
polynomial-time algorithm that a node in a hypercube-like network can be
diagnosed correctly in three test rounds under the BGM diagnosis model