An Availability Model for MIN-Based Multiprocessors

Chitaranjan Das, Prasant Mohapatra, Lei Tien, Laxmi N. Bhuyan

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

System decomposition is a novel technique for modeling the dependability of complex systems without constructing a single-level Markov Chain (MC). This is demonstrated in this paper for the availability computation of a class of multiprocessors that uses 4×4 switching elements for the multistage interconnection network (MIN). The availability model is known as task-based availability, where a system is considered operational as long as the task requirements are satisfied. We develop two simple MC’s for the processors and memories and solve them using a software package, called HARP. The probabilities of i processing elements (PE’s) and j memory modules (MM’s) working at any time t, denoted as Pi(t) and Pj(t)9 are obtained from their corresponding MC’s. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE’s and j MM’s. A third MC is then developed for the switches to find the probability that the MIN provides the required (i x j) connection. Multiplying this term with Pt(t) and Pj(i), the probability of an (i x j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and the results are validated through simulation.

Original languageEnglish (US)
Pages (from-to)1118-1129
Number of pages12
JournalIEEE Transactions on Parallel and Distributed Systems
Volume4
Issue number10
DOIs
StatePublished - Jan 1 1993

Fingerprint

Availability
Data storage equipment
Markov processes
Switches
Processing
Software packages
Large scale systems
Decomposition

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Das, Chitaranjan ; Mohapatra, Prasant ; Tien, Lei ; Bhuyan, Laxmi N. / An Availability Model for MIN-Based Multiprocessors. In: IEEE Transactions on Parallel and Distributed Systems. 1993 ; Vol. 4, No. 10. pp. 1118-1129.
@article{ad21dd928ced44d189d8f8001ef66896,
title = "An Availability Model for MIN-Based Multiprocessors",
abstract = "System decomposition is a novel technique for modeling the dependability of complex systems without constructing a single-level Markov Chain (MC). This is demonstrated in this paper for the availability computation of a class of multiprocessors that uses 4×4 switching elements for the multistage interconnection network (MIN). The availability model is known as task-based availability, where a system is considered operational as long as the task requirements are satisfied. We develop two simple MC’s for the processors and memories and solve them using a software package, called HARP. The probabilities of i processing elements (PE’s) and j memory modules (MM’s) working at any time t, denoted as Pi(t) and Pj(t)9 are obtained from their corresponding MC’s. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE’s and j MM’s. A third MC is then developed for the switches to find the probability that the MIN provides the required (i x j) connection. Multiplying this term with Pt(t) and Pj(i), the probability of an (i x j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and the results are validated through simulation.",
author = "Chitaranjan Das and Prasant Mohapatra and Lei Tien and Bhuyan, {Laxmi N.}",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/71.246073",
language = "English (US)",
volume = "4",
pages = "1118--1129",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "10",

}

An Availability Model for MIN-Based Multiprocessors. / Das, Chitaranjan; Mohapatra, Prasant; Tien, Lei; Bhuyan, Laxmi N.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 10, 01.01.1993, p. 1118-1129.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An Availability Model for MIN-Based Multiprocessors

AU - Das, Chitaranjan

AU - Mohapatra, Prasant

AU - Tien, Lei

AU - Bhuyan, Laxmi N.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - System decomposition is a novel technique for modeling the dependability of complex systems without constructing a single-level Markov Chain (MC). This is demonstrated in this paper for the availability computation of a class of multiprocessors that uses 4×4 switching elements for the multistage interconnection network (MIN). The availability model is known as task-based availability, where a system is considered operational as long as the task requirements are satisfied. We develop two simple MC’s for the processors and memories and solve them using a software package, called HARP. The probabilities of i processing elements (PE’s) and j memory modules (MM’s) working at any time t, denoted as Pi(t) and Pj(t)9 are obtained from their corresponding MC’s. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE’s and j MM’s. A third MC is then developed for the switches to find the probability that the MIN provides the required (i x j) connection. Multiplying this term with Pt(t) and Pj(i), the probability of an (i x j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and the results are validated through simulation.

AB - System decomposition is a novel technique for modeling the dependability of complex systems without constructing a single-level Markov Chain (MC). This is demonstrated in this paper for the availability computation of a class of multiprocessors that uses 4×4 switching elements for the multistage interconnection network (MIN). The availability model is known as task-based availability, where a system is considered operational as long as the task requirements are satisfied. We develop two simple MC’s for the processors and memories and solve them using a software package, called HARP. The probabilities of i processing elements (PE’s) and j memory modules (MM’s) working at any time t, denoted as Pi(t) and Pj(t)9 are obtained from their corresponding MC’s. The effect of the MIN is captured in the model by finding the number of switches required for the connection of i PE’s and j MM’s. A third MC is then developed for the switches to find the probability that the MIN provides the required (i x j) connection. Multiplying this term with Pt(t) and Pj(i), the probability of an (i x j) working group is obtained. The methodology is generalized to model arbitrary as well as larger size systems. Transient and steady state availabilities are computed for a variety of MIN configurations and the results are validated through simulation.

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

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

U2 - 10.1109/71.246073

DO - 10.1109/71.246073

M3 - Article

VL - 4

SP - 1118

EP - 1129

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 10

ER -