New algorithm for constructing fault-tolerant solutions of the circulant graph configuration

DOI10.1016/S0167-8191(96)00630-8MaRDI QIDQ1350019zbMATH OpenOpenAlexFDO

Authors Abdel Aziz Farrag

Publication date 27 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(96)00630-8

zbMATH Keywords

AlgorithmsCirculant graphsFault-toleranceFault-tolerant extensionsGraphsMeshesParallel architectures

Mathematics Subject Classification ID

Computer system organization (68M99) Parallel algorithms in computer science (68W10)

Recommendations

• Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and \(k\)-fault-tolerance
• Fault-Tolerant Meshes with Small Degree
• Tolerating faulty edges in a multi-dimensional mesh

Cited in

(2)

• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

This page was built for publication: New algorithm for constructing fault-tolerant solutions of the circulant graph configuration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350019)