This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes
November 1997 (vol. 8 no. 11)
pp. 1171-1183

Abstract—An incomplete hypercube possesses virtually every advantage of complete hypercubes, including simple deadlock-free routing, a small diameter, bounded link traffic density, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty hypercube into a maximum incomplete cube so as to lower potential performance degradation, because a hypercube so reconfigured often results in a much larger system than what is attainable according to any conventional reconfiguration scheme which identifies only complete subcubes. A maximum incomplete subcube involves one maximum complete subcube, plus certain smaller complete subcubes, and, thus, may accommodate multiple jobs of different sizes simultaneously, delivering a higher performance level. This paper proposes an efficient approach for identifying all the maximum incomplete subcubes present in a faulty hypercube. The proposed approach is on the basis of manipulating Boolean expressions, with the search space reduced considerably by taking advantage of the basic properties of faulty hypercubes during expression manipulation. It is distributed, in that every healthy node executes the same identification algorithm independently, at the same time. It is confirmed by fault simulation that our approach indeed gives rise to significantly larger reconfigured systems and requires short execution times.

[1] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[2] J.C. Peterson et al., "The Mark III Hypercube-Ensemble Concurrent Computer," Proc. 1985 Int'l Conf. Parallel Processing, pp. 71-73, Aug. 1985.
[3] Intel Corporation, iPSC/2 and iPSC/860 User's Guide. Intel Corporation, June 1990.
[4] NCUBE Corporation, n-CUBE 2 Processor Manual. NCUBE Corporation, 1990.
[5] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[6] B. Becker and H.-U. Simon, "How Robust is the n-Cube?," Proc. IEEE 27th Symp. Foundations of Computer Science, pp. 283-291, Oct. 1986.
[7] F. Ozguner and C. Aykanat, "A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor," Information Processing Letters, vol. 29, pp. 247-254, Nov. 988.
[8] M.A. Sridhar and C.S. Raghavendra, "On Finding Maximal Subcubes in Residual Hypercubes," Proc. Second IEEE Symp. Parallel and Distributed Processing, pp. 870-873, Dec. 1990.
[9] S. Latifi, "Distributed Subcube Identification Algorithms for Reliable Hypercubes," Information Processing Letters, vol. 38, pp. 315-321, June 1991.
[10] H.-L. Chen and N.-F. Tzeng, "Quick Determination of Subcubes in a Faulty Hypercube," Proc. 21st Int'l Conf. Parallel Processing, vol. III, pp. 338-345, Aug. 1992.
[11] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[12] N.-F. Tzeng and H. Kumar, "Analysis of Link Traffic in Incomplete Hypercubes," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 312-319, Dec. 1993.
[13] H. Sullivan and T.R. Bashkow, "A Large Scale, Homogenous, Fully Distributed Parallel Machine," Proc. Fourth Ann. Int'l Symp. Computer Architecture, pp. 105-117, May 1977.
[14] J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean n-Cube Array of Microprocessors," IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
[15] J.M. Gordon and Q.F. Stout, “Hypercube Message Routing in the Presence of Faults,” Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 318-327, Jan. 1988.
[16] M.-S. Chen and K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,406-1,416, Dec. 1990.
[17] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,654-1,657, Dec. 1988.
[18] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[19] P.K. McKinley,H. Xu,E. Kalns,, and L.M. Ni,“ComPaSS: Efficient communication services for scalable architectures,” Proc. Supercomputing’92, pp. 478-487, Nov. 1992.
[20] N.-F. Tzeng and H. Kumar, "Traffic Analysis and Simulation Performance of Incomplete Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 7, pp. 740-754, July 1996.
[21] H.-L. Chen and N.-F. Tzeng, "Subcube Determination in Faulty Hypercubes," IEEE Trans. Computers, vol. 46, no. 8, pp. 871-879, Aug. 1997.
[22] N.-F. Tzeng and G. Lin, "Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults," IEEE Trans. Computers, vol. 45, no. 11, pp. 1,303-1,308, Nov. 1996.

Index Terms:
Boolean expressions, distributed algorithms, faulty hypercubes, incomplete subcubes, reconfiguration.
Citation:
Hsing-Lung Chen, Nian-Feng Tzeng, "A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1171-1183, Nov. 1997, doi:10.1109/71.642951
Usage of this product signifies your acceptance of the Terms of Use.