This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
October 1989 (vol. 38 no. 10)
pp. 1425-1446
A highly versatile communication architecture, the bisectional interconnection network, is proposed. These networks possess many attractive features such as small internode distances, ability to do self-routing which is easily extendible to failure conditions, and the capability of maximal fault tolerance. The proposed architecture allows optimal implementation of various logical configurations

[1] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleann-cube array of microprocessors,"IEEE Trans. Comput., vol. C-30, pp. 581-590, Aug. 1981.
[2] J. P. Hayes, T. N. Mudge, and Q. F. Stout, "Architecture of a hypercube supercomputer," inProc. IEEE 1986 Int. Conf. Parallel Processing, 1986, pp. 653-660.
[3] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C-30, pp. 264-273, Apr. 1981.
[4] E. Horowitz and A. Zorat, "The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI,"IEEE Trans. Comput., vol. C-30, pp. 247-253, Apr. 1981.
[5] A. M. Despain and D. A. Patterson, "X-tree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144-151.Comput. Architecture, pp. 21-28, Dec. 1973.
[6] S. J. Stolfo, "The DADO parallel computer," Tech. Rep., Dep. Comput. Sci., Columbia Univ., CUCS-63-83, 1983.
[7] D. J. Farber and K. C. Larson, "The system architecture of the distributed computer system--The communication system," inProc. Symp. Comput. Commum. Networks Teletraffic. Brooklyn, NY: Brooklyn Polytechnic Press, Apr. 1972, pp. 21-27.
[8] E. M. Aupperle, "MERIT computer network: Hardware consideration," inComputer Networks, R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 49-63.
[9] Y. Saad and M. H. Schultz, "Topological properties of hypercubes," Res. Rep. YALEU/DCS/RR-389, Yale Univ., June 1985.
[10] D. K. Pradhan and S. M. Reddy, "A fault-tolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C- 31, pp. 863-870, Sept. 1982.
[11] D. K. Pradhan, "Fault-tolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. 34, pp. 33-45, Jan. 1985.
[12] D. K. Pradhan, "Fault-tolerant architecture for multiprocessor and VLSI systems," inProc. FTCS-13, Milano, Italy, June 1983, pp. 436-441.
[13] L. N. Bhuyan and D. P. Agrawal, "Design and performance of a general class of interconnection networks,"IEEE Trans. Comput., vol. C-30, pp. 587-590, Aug. 1981.
[14] L. W. Hawkes, "A regular fault-tolerant architecture for interconnection networks,"IEEE Trans Comput., vol. C-34, pp. 677-680, July 1985.
[15] Q. F. Stout, "Mesh connected computers with broadcast,"IEEE Trans Comput., vol. C-30, pp. 291-295, Apr. 1981.
[16] M. L. Schlumberger, "DeBruijn communication networks," Ph.D. dissertation, Stanford Univ., Stanford, 1974.
[17] B. W. Arden and H. Lee, "Analysis of chordal ring network,"IEEE Trans. Comput., vol. C-30, pp. 291-295, Apr. 1981.
[18] P. Delsarte, "Four fundamental parameters of a code and their combinatorial significance,"Inform. Contr., vol. 23, pp. 407-438, 1973.
[19] M. Hall Jr.,Combinatorial Theory. Blaisdell, 1967.
[20] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes, Vols. I and II. New York: North-Holland, 1977.
[21] L. D. Baumert, "Cyclic difference sets," Lect. Notes in Math., vol. 182. London Mathematical Society. New York: Springer-Verlag, 1971.
[22] R. C. Bose, "One the construction of balanced incomplete block design,"Ann. Eugen., vol. 9, pp. 353-399, 1939.
[23] J. Opatrny, N. Srinivansan, and V. S. Alagar, "Constructions of large fault-tolerant communication network models," inProc. 16th FTCS, July 1986, pp. 110-115.
[24] A. Ghafoor, "Comments to 'A regular fault-tolerant architecture for interconnection networks,'"IEEE Trans. Comput., submitted for publication.
[25] H. T. Kung, "The structure of parallel algorithm,"Advances Comput., vol. 19, 1980.
[26] A. Ghafoor, "Some classes of fault-tolerant communication architecture for distributed systems," Tech. Rep. TR-85-4, Dep. Elec. Comput. Eng., Syracuse Univ., 1985.
[27] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[28] J. Maeng and M. Malek, "A comparison connection assignment of self-diagnosis of multiprocessor systems," inProc. FTCS-11, June 1981, pp. 173-175.
[29] M. Malek and J. Maeng, "Partitioning of large multiprocessor systems for efficient fault diagnosis," inProc. FTFC-12, Santa Monica, CA, June 1982, pp. 341-348.
[30] F. P. Preparate, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable system,"IEEE Trans Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.
[31] W. D. Groop and I. C. F. Ipsen, "Embedding binary trees into a hypercube," inProc. Second SlAM Conf. Parallel Processing Scient. Comput., Norfolk, VA, Nov. 1985.
[32] S. L. Hakimi and A. T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C- 23, pp. 86-88, Jan. 1974.
[33] A. Varma, "Combinational design of bus-based interconnection schemes," IBM Tech. Rep. RC 12550, Yorktown Heights, NY, Sept. 1986.
[34] J. C. Bermond, C. Delmore, and J. J. Quisquater, "Tables of large graphs with given degree and diameter,"Inform. Processing Lett., vol. 15, no. 1, pp. 10-13, 1982.
[35] T. Soneoka, H. Nakada, and M. Imase, "Sufficient conditions for maximally connected dense graphs,"Discrete Math.vol. 63, pp. 53- 66, 1987.
[36] Z. Kohavi,Switching and Finite Automata Theory. New York: McGraw-Hill, 1976.

Index Terms:
supercomputer systems; communication architecture; bisectional interconnection network; self-routing; fault tolerance; combinatorial structure; symmetric balanced incomplete block design; SBIBD; partitioning; fault tolerant computing; multiprocessor interconnection networks.
Citation:
A. Ghafoor, T.R. Bashkow, I. Ghafoor, "Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems," IEEE Transactions on Computers, vol. 38, no. 10, pp. 1425-1446, Oct. 1989, doi:10.1109/12.35837
Usage of this product signifies your acceptance of the Terms of Use.