Efficient distributed reconfiguration for binary trees on Diogenes model

E. H.M. Sha, L. F. Chao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages464-471
Number of pages8
ISBN (Electronic)0780306058, 9780780306059
DOIs
StatePublished - 1992
Externally publishedYes
Event11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Scottsdale, United States
Duration: 1 Apr 19923 Apr 1992

Publication series

Name11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Proceedings

Conference

Conference11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992
Country/TerritoryUnited States
CityScottsdale
Period1/04/923/04/92

Fingerprint

Dive into the research topics of 'Efficient distributed reconfiguration for binary trees on Diogenes model'. Together they form a unique fingerprint.

Cite this