Availability evaluation of min-connected multiprocessors using decomposition technique

Chitaranjan Das, Lei Tien, Laxmi N. Bhuyan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An analytical technique for the availability evaluation of multiprocessors using a multistage interconnection network (MIN) is presented. The MIN represents a Butterfly-type connection with a 4 × 4-switching element (SE). The novelty of this approach is that the complexity of constructing a single-level exact Markov chain (MC) is not required. By use of structural decomposition, the system is divided into three subsystems--processors, memories, and MIN. Two simple MCs are solved by using a software package, called HARP, to find the probability of i working processing elements (PEs) and j working memory modules (MMs) at time t. A second level of decomposition is then used to find the approximate number of SEs (x) required for connecting the i PEs and j MMs. A third MC is then solved to find the probability that the MIN will provide the necessary communication. The model has been validated through simulation for up to a 256-node configuration, the maximum size available for a commercial MIN-connected multiprocessor.

Original languageEnglish (US)
Title of host publicationDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
PublisherPubl by IEEE
Pages176-183
Number of pages8
ISBN (Print)081862051X
StatePublished - 1990
Event20th International Symposium on Fault-Tolerant Computing - FTCS 20 - Chapel Hill, NC, USA
Duration: Jun 26 1990Jun 28 1990

Other

Other20th International Symposium on Fault-Tolerant Computing - FTCS 20
CityChapel Hill, NC, USA
Period6/26/906/28/90

Fingerprint

Availability
Decomposition
Data storage equipment
Markov processes
Processing
Software packages
Communication

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Das, C., Tien, L., & Bhuyan, L. N. (1990). Availability evaluation of min-connected multiprocessors using decomposition technique. In Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) (pp. 176-183). Publ by IEEE.
Das, Chitaranjan ; Tien, Lei ; Bhuyan, Laxmi N. / Availability evaluation of min-connected multiprocessors using decomposition technique. Digest of Papers - FTCS (Fault-Tolerant Computing Symposium). Publ by IEEE, 1990. pp. 176-183
@inproceedings{ef4d4028d1b441b386b6f41804c6bac8,
title = "Availability evaluation of min-connected multiprocessors using decomposition technique",
abstract = "An analytical technique for the availability evaluation of multiprocessors using a multistage interconnection network (MIN) is presented. The MIN represents a Butterfly-type connection with a 4 × 4-switching element (SE). The novelty of this approach is that the complexity of constructing a single-level exact Markov chain (MC) is not required. By use of structural decomposition, the system is divided into three subsystems--processors, memories, and MIN. Two simple MCs are solved by using a software package, called HARP, to find the probability of i working processing elements (PEs) and j working memory modules (MMs) at time t. A second level of decomposition is then used to find the approximate number of SEs (x) required for connecting the i PEs and j MMs. A third MC is then solved to find the probability that the MIN will provide the necessary communication. The model has been validated through simulation for up to a 256-node configuration, the maximum size available for a commercial MIN-connected multiprocessor.",
author = "Chitaranjan Das and Lei Tien and Bhuyan, {Laxmi N.}",
year = "1990",
language = "English (US)",
isbn = "081862051X",
pages = "176--183",
booktitle = "Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)",
publisher = "Publ by IEEE",

}

Das, C, Tien, L & Bhuyan, LN 1990, Availability evaluation of min-connected multiprocessors using decomposition technique. in Digest of Papers - FTCS (Fault-Tolerant Computing Symposium). Publ by IEEE, pp. 176-183, 20th International Symposium on Fault-Tolerant Computing - FTCS 20, Chapel Hill, NC, USA, 6/26/90.

Availability evaluation of min-connected multiprocessors using decomposition technique. / Das, Chitaranjan; Tien, Lei; Bhuyan, Laxmi N.

Digest of Papers - FTCS (Fault-Tolerant Computing Symposium). Publ by IEEE, 1990. p. 176-183.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Availability evaluation of min-connected multiprocessors using decomposition technique

AU - Das, Chitaranjan

AU - Tien, Lei

AU - Bhuyan, Laxmi N.

PY - 1990

Y1 - 1990

N2 - An analytical technique for the availability evaluation of multiprocessors using a multistage interconnection network (MIN) is presented. The MIN represents a Butterfly-type connection with a 4 × 4-switching element (SE). The novelty of this approach is that the complexity of constructing a single-level exact Markov chain (MC) is not required. By use of structural decomposition, the system is divided into three subsystems--processors, memories, and MIN. Two simple MCs are solved by using a software package, called HARP, to find the probability of i working processing elements (PEs) and j working memory modules (MMs) at time t. A second level of decomposition is then used to find the approximate number of SEs (x) required for connecting the i PEs and j MMs. A third MC is then solved to find the probability that the MIN will provide the necessary communication. The model has been validated through simulation for up to a 256-node configuration, the maximum size available for a commercial MIN-connected multiprocessor.

AB - An analytical technique for the availability evaluation of multiprocessors using a multistage interconnection network (MIN) is presented. The MIN represents a Butterfly-type connection with a 4 × 4-switching element (SE). The novelty of this approach is that the complexity of constructing a single-level exact Markov chain (MC) is not required. By use of structural decomposition, the system is divided into three subsystems--processors, memories, and MIN. Two simple MCs are solved by using a software package, called HARP, to find the probability of i working processing elements (PEs) and j working memory modules (MMs) at time t. A second level of decomposition is then used to find the approximate number of SEs (x) required for connecting the i PEs and j MMs. A third MC is then solved to find the probability that the MIN will provide the necessary communication. The model has been validated through simulation for up to a 256-node configuration, the maximum size available for a commercial MIN-connected multiprocessor.

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

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

M3 - Conference contribution

AN - SCOPUS:0025592738

SN - 081862051X

SP - 176

EP - 183

BT - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)

PB - Publ by IEEE

ER -

Das C, Tien L, Bhuyan LN. Availability evaluation of min-connected multiprocessors using decomposition technique. In Digest of Papers - FTCS (Fault-Tolerant Computing Symposium). Publ by IEEE. 1990. p. 176-183