Designing fault-tolerant systems using automorphisms
dc.contributor.author | Dutt, Shantanu | en_US |
dc.contributor.author | Hayes, John P. (John Patrick) | en_US |
dc.date.accessioned | 2006-04-10T14:53:39Z | |
dc.date.available | 2006-04-10T14:53:39Z | |
dc.date.issued | 1991-07 | en_US |
dc.identifier.citation | Dutt, Shantanu, Hayes, John P. (1991/07)."Designing fault-tolerant systems using automorphisms." Journal of Parallel and Distributed Computing 12(3): 249-268. <http://hdl.handle.net/2027.42/29588> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WKJ-4BRJK41-KD/2/96f6cb275376dfbcdd479d8ecf68c046 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29588 | |
dc.description.abstract | This paper presents a general theory for modeling and designing fault-tolerant multiprocessor systems in a systematic and efficient manner. We are concerned here with structural fault tolerance, defined as the ability to reconfigure around faults in order to preserve the interconnection structure of a multiprocessor. We represent multiprocessor systems by graphs whose node sets denote processors and whose edge sets denote dedicated interprocessor links. The fault-tolerant design and reconfiguration process of a multiprocessor is modeled by graph automorphisms. This automorphism-based methodology also models some important practical design features not previously addressed, including applicability to any multiprocessor structure and any number of faults. Low redundancy and efficient reconfigurability are also addressed. We apply our approach directly to a class of regular multiprocessor graphs termed circulant. For noncirculant graphs we give an algorithm to construct their circulant edge supergraphs efficiently. An application of the theory to the design of fault-tolerant hypercube multiprocessors is described. The resulting designs are shown to be far superior to those proposed in previous work. | en_US |
dc.format.extent | 2306893 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Designing fault-tolerant systems using automorphisms | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2110, USA | en_US |
dc.contributor.affiliationother | Department of Electrical Engineering, University of Minnesota, Minneapolis, Minnesota 55455, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29588/1/0000677.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0743-7315(91)90129-W | en_US |
dc.identifier.source | Journal of Parallel and Distributed Computing | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.