Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
On allocating subcubes in a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
On subcube dependability in a hypercube
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Combinatorial Analysis of Subcube Reliability in Hypercubes
IEEE Transactions on Computers
On Dependability Evaluation of Mesh-Connected Processors
IEEE Transactions on Computers
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
A Hierarchical Modeling and Analysis for Grid Service Reliability
IEEE Transactions on Computers
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
Modeling user-perceived service availability
ISAS'05 Proceedings of the Second international conference on Service Availability
| Hi-index | 0.01 |
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 greater than or equals n, for task execution. The dependability is computed by multiplying the probability that x nodes (math) 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.