On Optimizing Diameter and Average Distance of Directed Interconnected Networks

A generic approach to constructing the topology of fixed degree directed networks for a given node degree and size is proposed. The topology has minimum diameter and makes it possible to answer Maekawa's problem partially. In addition, an expansion operator Ex(x,n) is provided to scale the network size. Fast routing algorithms for these networks that have logarithmic time complexity while using constant buffer size are presented. >

[1]  Mamoru Maekawa.  Optimal processor interconnection topologies , 1981, ISCA '81.

[2]  F. Warren Burton,et al.  Virtual Tree Machines , 1984, IEEE Transactions on Computers.

[3]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[4]  Maurice Lorrain Schlumberger,et al.  De bruijn communications networks. , 1974 .

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

[6]  Peyyun P Li.  A parallel execution model for logic programming , 1986 .

[7]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[8]  Jürgen Günter Kienhöfer.  Rückgekoppelte Baumrechner und Programmierung , 1989, Angew. Inform..

[9]  R. M. Storwick,et al.  Improved Construction Techniques for (d, k) Graphs , 1970, IEEE Transactions on Computers.

[10]  M. Horn,et al.  Verbindungsstrukturen für Mikroprozessoren , 1988, Inform. Spektrum.

[11]  Frans J. Peters,et al.  Tree machines and divide-and-conquer algorithms , 1981, CONPAR.

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

[13]  Dhiraj K. Pradhan,et al.  The de Bruijn multiprocessor network: a versatile sorting network , 1985, ISCA 1985.

[14]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

[15]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[16]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[17]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[18]  Heinrich Braun.  Massiv parallele Algorithmen für kombinatorische Optimierungsprobleme und ihre Implementierung auf einem Parallelrechner , 1990 .