DCC Linear Congruential Graphs: A New Class of Interconnection Networks

Let n be an integer and F={f/sub 1/:1/spl les/i/spl les/t for some integer t} be a finite set of linear functions. We define a linear congruential graph G(F, n) as a graph on the vertex set V={0, 1, ..., n-1}, in which any x/spl isin/V is adjacent to f/sub i/(x) mod n, 1/spl les/i/spl les/t. For a linear function g, and a subset V/sub 1/ of V we define a linear congruential graph G(F, n, g,V/sub 1/) as a graph on vertex set V, in which any x/spl isin/V is adjacent to f/sub i/(x) mod n, 1/spl les/i/spl les/t, and any x/spl isin/V/sub 1/ is also adjacent to g(x) mod n. 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]  Béla Bollobás,et al.  The Diameter of Random Graphs , 1981 .

[2]  M. R. Samatham,et al.  Correction to 'The De Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI' , 1991 .

[3]  Ding-Zhu Du,et al.  Generalized de Bruijn digraphs , 1988, Networks.

[4]  B W Arden,et al.  Analysis of Chordal Ring Network , 1981, IEEE Transactions on Computers.

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[7]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[8]  Charles Delorme,et al.  Large graphs with given degree and diameter. II , 1984, J. Comb. Theory, Ser. B.

[9]  Sven Skyum,et al.  Families of Fixed Degree Graphs for Processor Interconnection , 1984, IEEE Transactions on Computers.

[10]  Béla Bollobás,et al.  The Diameter of Graphs: a survey , 1981 .

[11]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[12]  G. Farhi,et al.  Large Graphs with Given Degree and Diameter III , 1982 .

[13]  Bernard Elspas,et al.  Topological constraints on interconnection-limited logic , 1964, SWCT.

[14]  Marvin H. Solomon,et al.  Dense Trivalent Graphs for Processor Interconnection , 1982, IEEE Transactions on Computers.

[15]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[16]  Maria M. Klawe,et al.  Limitations on Explicit Constructions of Expanding Graphs , 1984, SIAM J. Comput..

[17]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[18]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[19]  Ding-Zhu Du,et al.  Connectivity of Consecutive-d Digraphs , 1992, Discret. Appl. Math..

[20]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[21]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[22]  Jean-Claude Bermond,et al.  Large fault-tolerant interconnection networks , 1989, Graphs Comb..

[23]  Béla Bollobás,et al.  The diameter of random regular graphs , 1982, Comb..