Efficient distributed reconfiguration for binary trees on Diogenes model

The Diogenes model is a fault-tolerant model for many interconnection networks. The authors analyze a distributed reconfiguration algorithm for binary-tree structures based on this model. After a nonleaf node n in a binary tree has failed, the damage effect is minimized by substituting a leaf for n....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Annual Phoenix Conference on Computers and Communications, 11th, 1992 s. 464 - 471
Hlavní autoři: Sha, E.H.-M., Chao, L.-F.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1992
Témata:
Algorithm design and analysis
Binary trees
Chaotic communication
Fault tolerance
Maintenance
Multiprocessor interconnection networks
Performance analysis
Redundancy
Systolic arrays
Tree data structures
ISBN:9780780306059, 0780306058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Diogenes model is a fault-tolerant model for many interconnection networks. The authors analyze a distributed reconfiguration algorithm for binary-tree structures based on this model. After a nonleaf node n in a binary tree has failed, the damage effect is minimized by substituting a leaf for n. The number of processing elements and the communication cost involved in the reconfiguration process are analyzed in the worst case and the average case. Several measures are defined for analyzing the performance of reconfigurable algorithms. It is shown that the reconfiguration algorithm can make the binary-tree structure become expected-case locally reconfigurable but not locally reconfigurable. By modifying the original Diogenes construction, the reconfiguration algorithm can achieve local reconfigurability. The performance analysis is presented.< >
ISBN:9780780306059
0780306058
DOI:10.1109/PCCC.1992.200592