On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes

Faults in a network may take various forms such as hardware/software errors, node/link faults, etc. In this paper, node-faults are addressed. Let F be a faulty set of f les 2n - 6 conditional node-faults in an injured n-cube Q n such that every node of Q n still has at least two fault - free neighbo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Tz-Liang Kueng, Tyne Liang, Tan, J.J.M., Lih-Hsing Hsu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Bipartite graph Computer errors Computer networks Computer science Concurrent computing Conditional fault Hardware Hypercube Hypercubes Interconnection network Linear array Multiprocessor interconnection networks Parallel architectures Path embedding Software algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!