IEEE Trans on Parallel and Distributed Systems, 2009, 20(3): 367-378. The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model［J］.
(t, k)-Diagnosable System: A Generalization of the PMC Models［J］. Schemes for Fault-Tolerant Computing:a Comparison of Modularly Redundant and t-Diagnosable Systems［J］. A Theory of Diagnosability of Digital Systems［J］. On the Connection Assignment Problem of Diagnosable Systems［J］. Key words: hypercube, PMC model, conditional diagnosability, diagnosability algorithm The time complexity of the algorithm is O(N 2)for the n-dimensional hypercube with N nodes. The conditional diagnosability of faulty nodes can be effectively implemented when the number of the faulty nodes do not exceed 4(n-2)+1(n≥5). The nodes of the hypercube are divided into several sets through the diagnosis result between two adjacent nodes, and faulty sets and fault-free sets are identified through the realation among sets and the number of elements in the set. A conditional diagnosability algorithm for the hypercube based on the PMC model is proposed in the paper. This diagnosis method greatly enhances the effectiveness of the diagnosis. Conditional diagnosability is the method that assumes that none of the neighbors of any vertex in the system are faulty at the same time. 238000005192 partition Methods 0.Diagnosis has played an important role in the reliability of the interconnection network.230000000875 corresponding Effects 0.000 abstract description 17.
Priority to US08/314,726 priority Critical patent/US5642524A/en Application granted granted Critical Publication of US5642524A publication Critical patent/US5642524A/en Anticipated expiration legal-status Critical Status Expired - Fee Related legal-status Critical Current Links Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Application filed by Keeling John A. Priority date (The priority date is an assumption and is not a legal conclusion. Keeling Original Assignee Keeling John A. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Expired - Fee Related Application number US08/314,726 Inventor John A.
#Hypercube in mathematica pdf
Google Patents Methods for generating N-dimensional hypercube structures and improved such structuresĭownload PDF Info Publication number US5642524A US5642524A US08/314,726 US31472694A US5642524A US 5642524 A US5642524 A US 5642524A US 31472694 A US31472694 A US 31472694A US 5642524 A US5642524 A US 5642524A Authority US United States Prior art keywords hypercube nodes dimensional node binary Prior art date Legal status (The legal status is an assumption and is not a legal conclusion. Google Patents US5642524A - Methods for generating N-dimensional hypercube structures and improved such structures US5642524A - Methods for generating N-dimensional hypercube structures and improved such structures
0 kommentar(er)
