ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE.

A. Sengupta, Arunabha Sen, S. Bandyopadhyay

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

A class of optimally fault-tolerant multiprocessor network architecture is presented, based on the networks proposed earlier by D. K. Pradhan (1985), where the networks are presented by regular digraphs. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messages in the presence of faults is adaptive and unless the number of faults is equal to the degree of fault tolerance, the increase in routing delay in the presence of faults is minimal.

Original languageEnglish (US)
Pages (from-to)619-623
Number of pages5
JournalIEEE Transactions on Computers
VolumeC-36
Issue number5
StatePublished - May 1987
Externally publishedYes

Fingerprint

Network Architecture
Fault tolerance
Multiprocessor
Network architecture
Fault Tolerance
Fault-tolerant
Fault
Routing
Digraph
Vertex of a graph

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE. / Sengupta, A.; Sen, Arunabha; Bandyopadhyay, S.

In: IEEE Transactions on Computers, Vol. C-36, No. 5, 05.1987, p. 619-623.

Research output: Contribution to journalArticle

Sengupta, A, Sen, A & Bandyopadhyay, S 1987, 'ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE.', IEEE Transactions on Computers, vol. C-36, no. 5, pp. 619-623.
Sengupta, A. ; Sen, Arunabha ; Bandyopadhyay, S. / ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE. In: IEEE Transactions on Computers. 1987 ; Vol. C-36, No. 5. pp. 619-623.
@article{87b412f509e54ec7b5e1a7244d04baec,
title = "ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE.",
abstract = "A class of optimally fault-tolerant multiprocessor network architecture is presented, based on the networks proposed earlier by D. K. Pradhan (1985), where the networks are presented by regular digraphs. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messages in the presence of faults is adaptive and unless the number of faults is equal to the degree of fault tolerance, the increase in routing delay in the presence of faults is minimal.",
author = "A. Sengupta and Arunabha Sen and S. Bandyopadhyay",
year = "1987",
month = "5",
language = "English (US)",
volume = "C-36",
pages = "619--623",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - ON AN OPTIMALLY FAULT-TOLERANT MULTIPROCESSOR NETWORK ARCHITECTURE.

AU - Sengupta, A.

AU - Sen, Arunabha

AU - Bandyopadhyay, S.

PY - 1987/5

Y1 - 1987/5

N2 - A class of optimally fault-tolerant multiprocessor network architecture is presented, based on the networks proposed earlier by D. K. Pradhan (1985), where the networks are presented by regular digraphs. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messages in the presence of faults is adaptive and unless the number of faults is equal to the degree of fault tolerance, the increase in routing delay in the presence of faults is minimal.

AB - A class of optimally fault-tolerant multiprocessor network architecture is presented, based on the networks proposed earlier by D. K. Pradhan (1985), where the networks are presented by regular digraphs. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messages in the presence of faults is adaptive and unless the number of faults is equal to the degree of fault tolerance, the increase in routing delay in the presence of faults is minimal.

UR - http://www.scopus.com/inward/record.url?scp=0023345547&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023345547&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0023345547

VL - C-36

SP - 619

EP - 623

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 5

ER -