Fault-tolerant multiprocessor link and bus network architectures

Journal Article · Tue Jan 01 04:00:00 EST 1985 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1985.1676513· OSTI ID:5954466

Pradhan, D K

This paper presents a general class of regular networks which provide optimal (near-optimal) fault tolerance. The proposed networks compare favorably to other regular networks such as leaf-ringed binary trees and cube networks. In particular, the networks proposed possess certain advantages in that the number of connections per node is neither an arbitrarily fixed number (as in leaf-ringed trees) nor does it grow arbitrarily large with the size of the network (as in cube networks). This point has significant relevance to fault tolerance in that the degree of fault tolerance provided by the network can be varied according to the design specification. Also, the networks admit simple self routing of messages and that routing is adaptable to faults.

• Research Organization: Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
• OSTI ID: 5954466
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-34:1; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ARCHITECTURE
ARRAY PROCESSORS
COMPUTER NETWORKS
CONFIGURATION
DEFECTS
EQUIPMENT INTERFACES
RELIABILITY