Fault tolerance and diagnosability of burnt pancake networks under the comparison model

DOI10.1016/j.tcs.2015.03.027zbMath1309.68021OpenAlexW1971612934MaRDI QIDQ2342670

Sulin Song, Mi Chen, Shuming Zhou, Xiao-Yan Li

Publication date: 29 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.027

zbMATH Keywords

fault tolerancecomparison modelconditional diagnosabilityextra connectivityburnt pancake networks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Reliability analysis of the cactus-based networks, Vulnerability analysis of multiprocessor system based on burnt pancake networks, Neighbor-connectivity of pancake networks and burnt pancake networks, Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs, Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs, The generalized 3-connectivity of burnt pancake graphs and godan graphs, The pessimistic diagnosabilities of some general regular graphs, Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs, Paired 2-disjoint path covers of burnt pancake graphs with faulty elements, Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault, The extra connectivity and extra diagnosability of regular interconnection networks, Relationship between extra edge connectivity and component edge connectivity for regular graphs, Neighbor connectivity of pancake graphs and burnt pancake graphs

Cites Work

• Unnamed Item
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• Fault isolation and identification in general biswapped networks under the PMC diagnostic model
• Conditional diagnosability of arrangement graphs under the PMC model
• The conditional fault diagnosability of \((n, k)\)-star graphs
• On deriving conditional diagnosability of interconnection networks
• Fault diagnosability of arrangement graphs
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Polynomial-time sortable stacks of burnt pancakes
• On average and highest number of flips in pancake sorting
• Girth of pancake graphs
• On the embedding of cycles in pancake graphs
• Fault-tolerant routing in burnt pancake graphs
• Group-theoretic algorithms and graph isomorphism
• Bounds for sorting by prefix reversal
• On the problem of sorting burnt pancakes
• The (conditional) matching preclusion for burnt pancake graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• On the maximal connected component of a hypercube with faulty vertices III
• A group-theoretic model for symmetric interconnection networks
• On Fault Identification in Diagnosable Systems
• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of hypercube with faulty vertices
• Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model
• On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
• Optimization of Reduced Dependencies for Synchronous Sequential Machines