Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern

Abstract

Connectivity and diagnosability are two important metrics for reliability of multiprocessor systems. As generalizations of traditional connectivity, g-good neighbor connectivity (resp., diagnosability) and g-component connectivity (resp., diagnosability) are significant parameters to characterize invulnerability of multiprocessor systems. In this paper, we determine that g-good neighbor connectivity of DQcube(DQn), a compound graph based on disc-ring and hypercube, is κg(DQn)=2g(n+1−g) for 0≤g≤n−2. Immediately, we show that g-good neighbor diagnosability of DQn under PMC model and MM∗ model is tg(DQn)=2g(n+2−g)−1. In addition, we prove that (g+1)-component connectivity of DQn is cκg+1(DQn)=−12g2+(n+12)g+1, and (g+1)-component diagnosability of DQn under PMC model and MM∗ model is ctg+1(DQn)=−12g2+(n−12)g+n+1 for 1≤g≤n−2.