A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
From MaRDI portal
Publication:2458694
DOI10.1016/j.camwa.2006.09.008zbMath1147.68409OpenAlexW2027490069MaRDI QIDQ2458694
Publication date: 2 November 2007
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.09.008
Related Items (9)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Locally exchanged twisted cubes: connectivity and super connectivity ⋮ Embedding mutually edge-disjoint cycles into locally twisted cubes ⋮ Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ Linear layout of locally twisted cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes
Cites Work
- A new variation on hypercubes with smaller diameter
- Parallel concepts in graph theory
- Locally twisted cubes are 4-pancyclic.
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- Panconnectivity of locally twisted cubes
- Better adaptive diagnosis of hypercubes
- The Mobius cubes
- The locally twisted cubes
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- The twisted N-cube with application to multiprocessing
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
