منابع مشابه
Fault diagnosability of arrangement graphs
The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and to replace the faulty processors to maintain a system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. In this paper, we show that the largest connected component of the survival graph contains almost all...
متن کاملConditional fault tolerance of arrangement graphs
a r t i c l e i n f o a b s t r a c t Fault tolerance is especially important for interconnection networks, since the growing size of the networks increases its vulnerability to component failures. A classic measure for the fault tolerance of a network in the case of vertex failures is its connectivity. Given a network based on a graph G and a positive integer h, the R h-connectivity of G is th...
متن کاملFault tolerance in the arrangement graphs
Article history: Received 27 May 2013 Received in revised form 29 January 2014 Accepted 24 March 2014 Communicated by S.-y. Hsieh
متن کاملFault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
The arrangement graph An,k, which is a generalization of the star graph (n − k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously, the arrangement graph has proved Hamiltonian. In this paper, we further show that the arrangement graph remains Hamiltonian even if it is faulty. Let Fe and Fv denote ...
متن کاملDiagnosability Analysis without Fault Models
This paper addresses the problem of diagnosability analysis, which allows a system designer to anticipate the performance of a model based diagnosis (MBD) algorithm for a given system. Such analysis requires a formal description of the system behavior, called model, which can be very difficult to establish, especially when faults occur in the system. Despite this, all known diagnosability frame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2013
ISSN: 0020-0255
DOI: 10.1016/j.ins.2013.04.038