eprints
 

EPrints@IIT Delhi  >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2074/1688

Full metadata record

DC FieldValueLanguage
contributor.authorJain, B N-
contributor.authorMittal, R-
contributor.authorPatney, R K-
date.accessioned2006-06-23T11:08:07Z-
date.available2006-06-23T11:08:07Z-
date.issued1989-
identifier.citationDistributed Computing Systems, 524 - 531en
identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/1688-
description.abstractAn augmented binary (AB) tree architecture is proposed with a view to providing fault tolerance. This architecture is an augmentation of an n-level full binary tree with n redundant nodes and 2 n+3n-6 redundant links. The AB tree can be configured into a full binary tree even when one node is faulty at each level. While functionally equivalent to the RAE-tree, the proposed AB tree has a regular topology, reduced number of maximum input-output channels per processor, and fewer wire crossovers when implemented using very large-scale integration layout. A reconfiguration algorithm, which constructs an n-level full binary tree from an n-level faulty AB tree, is given. A distributed fault diagnosis algorithm is given which runs concurrently on each nonfaulty processor, enabling each nonfaulty processor to identify all faulty processorsen
format.extent94119 bytes-
format.mimetypeapplication/pdf-
language.isoenen
subjectaugmented binary (AB)en
subjectfault toleranceen
subjectn-level full binary treeen
subjectredundant nodesen
subjectfewer wire crossoversen
subjectdiagnosis algorithmen
titleFault-tolerant analysis and algorithms for a proposed augmented binary tree architectureen
typeArticleen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
jainfau1989.pdf91KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

eprints@IIT Delhi Copyright  © 2004-2005 Powered by DSpace Software  - Feedback