Optimal simulation of full binary trees on faulty hypercubes

We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1) tree fa ful...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems 1995-03, Vol.6 (3), p.269-286
Hauptverfasser:	Chan, B.M.Y., Chin, F.Y.L., Chung-Keung Poon
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Binary trees Computer science Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Hypercubes Robustness Senior members Simulation Software
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!