### 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 language | English (US) |
---|---|

Title of host publication | Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) |

Publisher | Publ by IEEE |

Pages | 176-183 |

Number of pages | 8 |

ISBN (Print) | 081862051X |

State | Published - 1990 |

Event | 20th International Symposium on Fault-Tolerant Computing - FTCS 20 - Chapel Hill, NC, USA Duration: Jun 26 1990 → Jun 28 1990 |

### Other

Other | 20th International Symposium on Fault-Tolerant Computing - FTCS 20 |
---|---|

City | Chapel Hill, NC, USA |

Period | 6/26/90 → 6/28/90 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture

### Cite this

*Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)*(pp. 176-183). Publ by IEEE.

}

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference 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

SN - 081862051X

SP - 176

EP - 183

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

PB - Publ by IEEE

ER -