
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Opatrny, D. Sotteau, N. Srinivasan, K. Thulasiraman, "DCC Linear Congruential Graphs: A New Class of Interconnection Networks," IEEE Transactions on Computers, vol. 45, no. 2, pp. 156164, February, 1996.  
BibTex  x  
@article{ 10.1109/12.485369, author = {J. Opatrny and D. Sotteau and N. Srinivasan and K. Thulasiraman}, title = {DCC Linear Congruential Graphs: A New Class of Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {2}, issn = {00189340}, year = {1996}, pages = {156164}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.485369}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  DCC Linear Congruential Graphs: A New Class of Interconnection Networks IS  2 SN  00189340 SP156 EP164 EPD  156164 A1  J. Opatrny, A1  D. Sotteau, A1  N. Srinivasan, A1  K. Thulasiraman, PY  1996 KW  Graph theory KW  interconnectons networks KW  network design KW  parallel processing KW  computer networks. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—Let
These graphs generalize several well known families of graphs, e.g., the de Bruijn graphs. We give a family of linear functions, called DCC linear functions, that generate regular, highly connected graphs which are of substantially larger order than de Bruijn graphs of the same degree and diameter. Some theoretical and empirical properties of these graphs are given and their structural properties are studied.
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] B.W. Arden and H. Lee, "Analysis of chordal ring network," IEEE Trans. Computers, vol. 30, no. 4, pp. 291295, Apr. 1981.
[3] J.C. Bermond and B. Bollobas, "The diameter of graphsa survey," Proc. Congressus Numerantium, vol. 32, pp. 327, 1981.
[4] J.C. Bermond, F. Comellas, and D.F. Hsu, “Distributed Loop Computers: A Survey,” J. Parallel and Distributed Computing, vol. 24, pp. 210, 1995.
[5] J.C. Bermond, C. Delorme, and G. Farhi, "Large graphs with given degree and diameter III," Proc. Coll. Cambridge (1981). Ann. Discrete Math. 13, NorthHolland, pp. 2332, 1982.
[6] J.C. Bermond and C. Delorme,“Strategies for interconnection networks: Some methods from graphtheory,” J. Parallel and Distributed Computing, vol. 3, pp. 433449, 1986.
[7] J.C. Bermond, N. Homobono, and C. Peyrat, "Large faulttolerant interconnection networks," First Japan Conf. Graph Theory and Applications,Hakone, Japan, June 1986.
[8] J.C. Bermond and C. Peyrat, "deBruijn, and Kautz networks: A competitor for the hypercube?" Proc. Conf. Hypercube and Distributed Computers, pp. 279294, 1989.
[9] B. Bollobas and W.F. de la Vega, "The diameter of random graphs," Combinatorica 2, pp. 125134, 1982.
[10] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. NorthHolland, 1976.
[11] N.G. deBruijn, "A combinatorial problem," Koninklije Nedderlandse Academie van Wetenshappen Proc., vol. serA49, pp. 758764, 1946.
[12] F.R.K. Chung, "Diameters of graphs: Old problems and new results," Proc. 18th SouthEastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium, pp. 295317, 1987.
[13] C. Delorme, "A table of large graphs of small degrees and diameters," personnal communication, 1990.
[14] D.Z. Du and F.K. Hwang, "Generalized de Bruijn Digraphs," Networks, vol. 18, pp. 2738, 1988.
[15] D.Z. Du, D.F. Hsu, and G.W. Peck, "Connectivity of consecutived digraphs," Discrete Applied Math., to appear.
[16] B. Elpas, "Topological constraints on interconnection limited logic," Switching Circuits Theory and Logical Design 5, pp. 133147, 1964.
[17] D.M. Gordon, "Parallel sorting on Cayley graphs, abstract," The Capital City Conf. Combinatorics and Theoretical Computer Science, May 1989.
[18] W.D. Hillis, The Connection Machine.Cambridge, Mass.: The MIT Press, 1985.
[19] M. Imase and M. Itoh, "Design to minimize diameter on building block network," IEEE Trans. Computers, vol. 30, pp. 439442, 1981.
[20] M. Jerrum and S. Skyum, "Families of fixed degree graphs for processor interconnection," IEEE Trans. Computers, vol. 33, pp. 190194, 1984.
[21] W.H. Kautz, "Bounds on directed (d, k) graphs," Theory of Cellular Logic Networks and Machines, SRI Project 7258, pp. 2028, 1968.
[22] M. Klawe, "Limitations on explicit constructions of expanding graphs," Siam J. Computing, vol. 13, no. 1, pp. 156166, 1984.
[23] D. Knuth, The Art of Computer Programming, Vol. 2, AddisonWesley, Reading, Mass., 1998.
[24] W. Leland and M. Solomon, "Dense trivalent graphs for processor interconnection," IEEE Trans. Computers, vol. 31, no. 3, pp. 219222, Mar. 1982.
[25] J. Opatrny and D. Sotteau, "Linear congruential graphs, graph theory, combinatorics, algorithms, and applications," SIAM Proc. series, pp. 404426, 1991.
[26] D.K. Pradhan, FaultTolerant Multiprocessor and VLSI Based Systems Communication Architecture, FaultTolerant Computing, Theory and Techniques vol. 2. PrenticeHall, 1986.
[27] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[28] M.R. Samantham and D.K. Pradhan, Correction to The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI," IEEE Trans. Computers, vol. 40, no. 1, p. 122, Jan. 1991.