On the maximal connected component of a hypercube with faulty vertices III

International Journal of Computer Mathematics

Volumn 83, Issue 1, 2006, Pages 27-37

  Yang, Xiaofan ^a   Evans, David J ^b   Megson, Graham M ^c  

^a CHONGQING UNIVERSITY   (China)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF READING   (United Kingdom)

Author keywords

Fault tolerance; Hypercube; Interconnection network; Maximal connected component

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS;

HYPERCUBE; MAXIMAL CONNECTED COMPONENT;

PROGRAM PROCESSORS;

EID: 30844450357     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160500113173     Document Type: Article

References (7)

1. Parhami, B., 1999, An Introduction to Parallel Processing: Algorithms and Architectures (New York: Plenum Press).
2. Esfahanian, A.H., 1989, Generalized measures of fault tolerance with application to N-cube networks. IEEE Transactions on Computers, 38, 1586-1691.
3. Yang, X., Evans, D.J., Chen, B., Megson, G.M. and Lai, H., 2004, On the maximal connected component of hypercube with faulty vertices. International Journal of Computer Mathematics, 81, 515-525.
4. Yang, X., Evans, D.J. and Megson, G.M., 2004, On the maximal connected component of hypercube with faulty vertices II. International Journal of Computer Mathematics, 81, 1175-1185.
5. Harary, F., 1969, Graph Theory (Reading, MA: Addison-Wesley).
6. Armstrong, J.R. and Gray, F.G., 1981, Fault diagnosis in a Boolean n cube array of microprocessors. IEEE Transactions on Computers, 30, 587-590.
7. Somani, A.K. and Peleg, O., 1996, On diagnosability of large fault sets in regular topology-based computer systems. IEEE Transactions on Computers, 45, 892-903.