Abstract
The reliability of processors is an important issue for designing a massively parallel processing system for which fault-tolerant computing is crucial. In order to achieve high system reliability and availability, a faulty processor (node) when found should be replaced by a fault-free processor. Within a multiprocessor system, the technique of identifying faulty nodes by constructing tests on the nodes and interpreting the test outcomes is known as system-level diagnosis. The topological structure of a multicomputer system can be modeled by a graph of which the vertices and edges correspond to nodes and links of the system, respectively. This work presents a system-level diagnosis algorithm for a generalized hypercube which is an attractive variance of a hypercube. The proposed algorithm is based on the PMC model and can isolate all faulty nodes to within a set which contains at most one fault-free node. If the total number of nodes to be diagnosed in a generalized hypercube is N, the proposed algorithm can run in O(Nlog N) time, and being superior to Yang’s algorithm proposed in 2004, it can diagnose not only a hypercube but also a generalized hypercube.
Similar content being viewed by others
References
Altman J et al (1996) Constraint based system-level diagnosis of multiprocessors. In: Proceedings of IEEE 2nd European dependable computing conference, pp 403–414
Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188–192
Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. Comput Graph Forum 8(1):3–12
Arabnia HR (1993) A transputer-based reconfigurable parallel system. In: Proceedings of the sixth conference of North American transputer users group on transputer research and applications 6 (NATUG-6), IOS Press, Vancouver, Canada, pp 153–169
Armstrong JR, Gray FG (1981) Fault diagnosis in a Boolean n cube array of microprocessors. IEEE Trans Comput C-30:587–590
Bartha T, Selenyi E (1997) Probabilistic system-level fault diagnostic algorithms for multiprocessors. Parallel Comput 22(13):1807–1821
Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor—theoretical properties and algorithms. Parallel Comput 21(11):1783–1805
Bhuyan LN, Agrawal DP (1984) Generalized hypercube and hyperbus structures for a computer network. IEEE Trans Comput 33:323–333
Bondy JA, Murty USR (1980) Graphs theory with applications. North-Holland, New York
Caruso A, Chessa S, Maestrini P, Santi P (2002) Diagnosability of regular systems. J Algorithms 45:126–143
Chang GY, Chang GJ, Chen GH (2005) Diagnosabilities of regular networks. IEEE Trans Parallel Distrib Syst 16(4):314–323
Chang GY, Chen GH, Chang GJ (2006) (t,k)-Diagnosis for matching composition networks. IEEE Trans Comput 55(1):88–92
Chang GY, Chen GH (2007) (t,k)-Diagnosability of multiprocessor systems with applications to grids and tori. SIAM J Comput 37(4):1280–1298
Chwa KY, Hakimi SL (1981) On fault identification in diagnosable systems. IEEE Trans Comput C-30:414–422
Cull P, Larson SM (1995) The Mobius cubes. IEEE Trans Comput 44:648–659
Efe K (1992) The crossed cube architecture for parallel computation. IEEE Trans Parallel Distrib Syst 3(5):513–524
Fan J, Lin X (2005) The t/k-diagnosability of the BC graphs. IEEE Trans Comput 54(2):176–184
Kavianpour A, Friedman AD (1978) Efficient design of easily diagnosable system. In: Proceedings of the 3th IEEE computer society’s USA–Japan computer conference, pp 173–181
Kavianpour A, Friedman AD (1984) Trade-offs in system level diagnosis of multiprocessor systems. In: Proceedings of AFIP national computer conference, pp 173–181
Kavianpour A, Kim KH (1991) Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy. IEEE Trans Comput 40:232–237
Khanna S, Fuchs WK (1997) A graph partitioning approach to sequential diagnosis. IEEE Trans Comput 46:39–47
Kranakis E, Pelc A (2000) Better adaptive diagnosis of hypercubes. IEEE Trans Comput 49:1013–1020
Lee RCT, Chang RC, Tseng SS, Tsai YT (1999) Introduction to the design and analysis of algorithms. Unalis Corporation, Taiwan
Maeng J, Malek M (1981) A comparison connection assignment for self-diagnosis of multiprocessor systems. In: Proc. 11th int’l symp. fault-tolerant computing, pp 173–175
Malek M (1980) A comparison connection assignment for diagnosis of multiprocessor systems. In: Proc. seventh int’l symp. computer architecture, pp 31–35
Parhami B (1999) An introduction to parallel processing: algorithms and architectures. Plenum, New York
Preparata FP, Metze G, Chien RT (1967) On the connection assignment problem of diagnosable systems. IEEE Trans Comput 16:448–454
Somani AK (1997) System level diagnosis: a review. Technical report, Dependable Computing Laboratory, Iowa State University
Somani AK, Peleg O (1996) On diagnosability of large fault sets in regular topology-based computer systems. IEEE Trans Comput 45(8):892–903
Sullivan G (1984) A polynomial time algorithm for fault diagnosability. In: Proceedings of the 25th annual symposium on foundations of computer science, pp 148–156
Tzeng NF, Wei S (1991) Enhanced hypercubes. IEEE Trans Comput 40(3):284–294
West DB (2001) Introduction to Graph theory, 2nd edn. Prentice-Hall, Upper Saddle River
Xu J (2001) Topological structure and analysis of interconnection networks. Kluwer Academic, Dordrecht
Yang X (2004) A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems. J Parallel Distrib Comput 64:546–553
Yang CL, Masson GM, Leonetti RA (1986) On fault isolation and identification in t 1/t 1-diagnosable systems. IEEE Trans Comput 35(7):639–643
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Duh, DR., Chen, CH. & Chang, KN. A fast pessimistic diagnosis algorithm for generalized hypercube multicomputer systems. J Supercomput 61, 605–618 (2012). https://doi.org/10.1007/s11227-011-0620-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-011-0620-6