A Unified Task-Based Dependability Model for Hypercube Computers

A unified analytical model for computing the task-based dependability (TDB) of hypercube architectures is presented. A hypercube is deemed operational as long as a task can be executed on the system. The technique can compute both reliability and availability for two types of task requirements-I-connected model and subcube model. The I-connected TBD assumes that a connected group of at least I working nodes is required for task execution. The subcube TBD needs at least an m-cube in an n-cube, m or=I or x>or=2/sup m/) are working in an n-cube at time t by the conditional probability that the hypercube can satisfy any one of the two task requirements from x working nodes. Recursive models are proposed for the two types of task requirements to find the connection probability. The subcube requirement is extended to find multiple subcubes for analyzing multitask dependability. The analytical results are validated through extensive simulation. >

[1]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[2]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[3]  Kishor S. Trivedi,et al.  Reliability Modeling Using SHARPE , 1987, IEEE Transactions on Reliability.

[4]  Daniel P. Siewiorek,et al.  Reliability models for multiprocessor systems with and without periodic maintenance , 1976 .

[5]  Krishnan Padmanabhan,et al.  Reliability of the Hypercube , 1988, ICPP.

[6]  Kishor S. Trivedi,et al.  Design of the hybrid automated reliability predictor , 1983 .

[7]  B. Bose,et al.  A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[8]  Thomas F. Arnold,et al.  The Concept of Coverage and Its Effect on the Reliability Model of a Repairable System , 1973, IEEE Transactions on Computers.

[9]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[10]  Chita R. Das,et al.  An analytical model for computing hypercube availability , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[11]  Sartaj Sahni,et al.  A Hypercube Algorithm for the 0/1 Knapsack Problem , 1988, J. Parallel Distributed Comput..

[12]  J. Kim,et al.  A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..

[13]  J. P. Hayes,et al.  On allocating subcubes in a hypercube multiprocessor , 1988, C3P.

[14]  Chita R. Das,et al.  On subcube dependability in a hypercube , 1991, SIGMETRICS '91.

[15]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[16]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[17]  Chita R. Das,et al.  Reliability evaluation of hypercube multicomputers , 1989 .

[18]  D. Grunwald,et al.  The Performance of Multicomputer Interconnection Networks , 1987, Computer.

[19]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.