
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
F.N. Sibai, N.K. Sharma, A.A. Abonamah, "Comparison of Reconfiguration Schemes for the C2SC MIN Operating in the Broadcast Mode," IEEE Transactions on Computers, vol. 43, no. 9, pp. 11121119, September, 1994.  
BibTex  x  
@article{ 10.1109/12.312121, author = {F.N. Sibai and N.K. Sharma and A.A. Abonamah}, title = {Comparison of Reconfiguration Schemes for the C2SC MIN Operating in the Broadcast Mode}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {9}, issn = {00189340}, year = {1994}, pages = {11121119}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.312121}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Comparison of Reconfiguration Schemes for the C2SC MIN Operating in the Broadcast Mode IS  9 SN  00189340 SP1112 EP1119 EPD  11121119 A1  F.N. Sibai, A1  N.K. Sharma, A1  A.A. Abonamah, PY  1994 KW  synchronisation; hypercube networks; fault tolerant computing; reliability; reconfigurable architectures; reconfiguration schemes; C2SC MIN; broadcast mode; complementary twostage cube; multiplepath multistage interconnection networks; destination discriminator; divide and broadcast; decoded routing tag; conservative schemes; cost/performance analysis; regularity; modularity; simulation results. VL  43 JA  IEEE Transactions on Computers ER   
The complementary twostage cube (C2SC) provides four paths between every source and destination pair so that all single faults and many multiple faults can be tolerated. One of the key issues in multiplepath multistage interconnection networks (MIN's) is the manner in which rerouting is achieved when the network has faults. In this paper, we present four reconfiguration schemes for broadcast connections of the C2SC in the presence of one or multiple faults, and these are: destination discriminator, divide and broadcast, decoded routing tag, and conservative schemes. A hardware implementation and a cost/performance analysis of the four schemes were carried out. The analysis includes comparison of hardware cost, reconfiguration time, costreconfiguration time product, and regularity and modularity. The cost/performance analysis and simulation results indicate that the destination discriminator scheme has the lowest costreconfiguration time product and has relatively high regularity and modularity.
[1] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, pp. 694702, Aug. 1980.
[2] J. H. Patel, "Performance of processormemory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C30, pp. 771780, Oct. 1981.
[3] G. B. Adams, D. P. Agrawal, and H. J. Siegel, "A survey and comparison of faulttolerant multistage interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 1427, June 1987.
[4] G. B. Adams and H. J. Siegel, "The extra stage cube: A faulttolerant interconnection network for supersystems,"IEEE Trans. Comput., vol. C31, p. 397408, May 1982.
[5] H. J. Siegel,Interconnection Networks for LargeScale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[6] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Trans. Comput., vol. C30, pp. 6576, Aug. 1981.
[7] M. C. Pease, "The indirect binaryncube multiprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[8] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[9] S. Thanawastien and V. P. Nelson, "Interference analysis of shuffle exchange networks,"IEEE Trans. Comput., vol. C30, pp. 545556, Aug. 1981.
[10] K. E. Batcher, "The flip network in STARAN," inProc. 1976 Int. Conf. Parallel Processing, Aug. 1976, pp. 6571.
[11] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 2128.
[12] F. N. Sibai and A. Abonamah, "The complementary twostage cube: A faulttolerant interconnection network,"Int. J. Mini and MicroComput., vol. 13, no. 3, pp. 117127, 1991.
[13] T.D. Han, D. A. Carlson, and S. P. Levitan, "A faulttolerant design of the generalized cube network," inProc. Int. Conf. Parallel Distributed Comput. Syst., Oct. 1990, pp. 160165.
[14] G. B. Adams and H. J. Siegel, "Modifications to improve the fault tolerance of the extra stage cube interconnection network," inProc. 1984 Int. Conf. Parallel Processing, Aug. 1984, pp. 169173.
[15] N. K. Sharma, F. N. Sibai, and A. Abonamah, "An efficient reconfiguration algorithm for onetoone connection of the C2SC network," inProc. 4th ISMM Int. Conf. Parallel Distrib. Comput. Syst., Washington, DC, Oct. 1991, pp. 15.
[16] N. K. Sharma, F. N. Sibai, and A. Abonamah, "Dynamic reconfiguration schemes for the C2SC network in the presence of faults,"Int. J. Mini MicroComput.
[17] N. K. Sharma, F. N. Sibai, and A. Abonamah, "A realtime recursive divide and broadcast reconfiguration scheme for the C2SC network,"Int. J. Mini MicroComput., vol. 13, pp. 100108, 1991.
[18] T. Y. Feng and C. L. Wu, "Fault diagnosis for a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C30, pp. 743758, Oct. 1981.
[19] K. Hwang,Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.