
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Ghafoor, T.R. Bashkow, I. Ghafoor, "Bisectional FaultTolerant Communication Architecture for Supercomputer Systems," IEEE Transactions on Computers, vol. 38, no. 10, pp. 14251446, October, 1989.  
BibTex  x  
@article{ 10.1109/12.35837, author = {A. Ghafoor and T.R. Bashkow and I. Ghafoor}, title = {Bisectional FaultTolerant Communication Architecture for Supercomputer Systems}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {10}, issn = {00189340}, year = {1989}, pages = {14251446}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.35837}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Bisectional FaultTolerant Communication Architecture for Supercomputer Systems IS  10 SN  00189340 SP1425 EP1446 EPD  14251446 A1  A. Ghafoor, A1  T.R. Bashkow, A1  I. Ghafoor, PY  1989 KW  supercomputer systems; communication architecture; bisectional interconnection network; selfrouting; fault tolerance; combinatorial structure; symmetric balanced incomplete block design; SBIBD; partitioning; fault tolerant computing; multiprocessor interconnection networks. VL  38 JA  IEEE Transactions on Computers ER   
[1] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleanncube array of microprocessors,"IEEE Trans. Comput., vol. C30, pp. 581590, 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. 653660.
[3] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C30, pp. 264273, 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. C30, pp. 247253, Apr. 1981.
[5] A. M. Despain and D. A. Patterson, "Xtree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144151.Comput. Architecture, pp. 2128, Dec. 1973.
[6] S. J. Stolfo, "The DADO parallel computer," Tech. Rep., Dep. Comput. Sci., Columbia Univ., CUCS6383, 1983.
[7] D. J. Farber and K. C. Larson, "The system architecture of the distributed computer systemThe communication system," inProc. Symp. Comput. Commum. Networks Teletraffic. Brooklyn, NY: Brooklyn Polytechnic Press, Apr. 1972, pp. 2127.
[8] E. M. Aupperle, "MERIT computer network: Hardware consideration," inComputer Networks, R. Rustin, Ed. Englewood Cliffs, NJ: PrenticeHall, 1972, pp. 4963.
[9] Y. Saad and M. H. Schultz, "Topological properties of hypercubes," Res. Rep. YALEU/DCS/RR389, Yale Univ., June 1985.
[10] D. K. Pradhan and S. M. Reddy, "A faulttolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C 31, pp. 863870, Sept. 1982.
[11] D. K. Pradhan, "Faulttolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. 34, pp. 3345, Jan. 1985.
[12] D. K. Pradhan, "Faulttolerant architecture for multiprocessor and VLSI systems," inProc. FTCS13, Milano, Italy, June 1983, pp. 436441.
[13] L. N. Bhuyan and D. P. Agrawal, "Design and performance of a general class of interconnection networks,"IEEE Trans. Comput., vol. C30, pp. 587590, Aug. 1981.
[14] L. W. Hawkes, "A regular faulttolerant architecture for interconnection networks,"IEEE Trans Comput., vol. C34, pp. 677680, July 1985.
[15] Q. F. Stout, "Mesh connected computers with broadcast,"IEEE Trans Comput., vol. C30, pp. 291295, 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. C30, pp. 291295, Apr. 1981.
[18] P. Delsarte, "Four fundamental parameters of a code and their combinatorial significance,"Inform. Contr., vol. 23, pp. 407438, 1973.
[19] M. Hall Jr.,Combinatorial Theory. Blaisdell, 1967.
[20] F. J. MacWilliams and N. J. A. Sloane,The Theory of ErrorCorrecting Codes, Vols. I and II. New York: NorthHolland, 1977.
[21] L. D. Baumert, "Cyclic difference sets," Lect. Notes in Math., vol. 182. London Mathematical Society. New York: SpringerVerlag, 1971.
[22] R. C. Bose, "One the construction of balanced incomplete block design,"Ann. Eugen., vol. 9, pp. 353399, 1939.
[23] J. Opatrny, N. Srinivansan, and V. S. Alagar, "Constructions of large faulttolerant communication network models," inProc. 16th FTCS, July 1986, pp. 110115.
[24] A. Ghafoor, "Comments to 'A regular faulttolerant 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 faulttolerant communication architecture for distributed systems," Tech. Rep. TR854, Dep. Elec. Comput. Eng., Syracuse Univ., 1985.
[27] J. G. Kuhl and S. M. Reddy, "Distributed faulttolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[28] J. Maeng and M. Malek, "A comparison connection assignment of selfdiagnosis of multiprocessor systems," inProc. FTCS11, June 1981, pp. 173175.
[29] M. Malek and J. Maeng, "Partitioning of large multiprocessor systems for efficient fault diagnosis," inProc. FTFC12, Santa Monica, CA, June 1982, pp. 341348.
[30] F. P. Preparate, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable system,"IEEE Trans Electron. Comput., vol. EC16, pp. 848854, 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. 8688, Jan. 1974.
[33] A. Varma, "Combinational design of busbased 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. 1013, 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: McGrawHill, 1976.