DocumentCode
1132658
Title
Quick recovery of two embedded complete binary trees in a hypercube
Author
Hsu, C.-C. ; Liu, Y.-W.
Author_Institution
Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
Volume
141
Issue
4
fYear
1994
fDate
7/1/1994 12:00:00 AM
Firstpage
205
Lastpage
211
Abstract
The authors propose a novel approach for embedding a (d-1) level and a (d-2) level complete binary tree (CBT) into a d-dimensional hypercube (d-cube). Moreover, free processors are used as spare processors to recover a single fault in the two trees. The primary results are that the (d-1)-CBT can be recovered in at most two steps and the (d-2)-CBT in one step. The dilation of the recovered embedding is at most two and the processor utilisation is near 75%
Keywords
fault tolerant computing; hypercube networks; system recovery; trees (mathematics); d-dimensional hypercube; dilation; embedded complete binary trees; fault recovery; free processors; quick recovery; spare processors;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:19941150
Filename
304077
Link To Document