Topological structure and analysis of interconnection networks
- Includes bibliographical references and index.
- 1. Interconnection Networks and Graphs. 1.1. Graphs and Interconnection Networks. 1.2. Basic Concepts and Notations on Graphs. 1.3. Trees, Embeddings and Planar Graphs. 1.4. Transmission Delay and Diameter. 1.5. Fault Tolerance and Connectivity. 1.6. Basic Principles of Network Design
- 2. Design Methodology of Topological Structure of Interconnection Networks. 2.1. Line Graphical Method. 2.2. Cayley Method. 2.3. Cartesian Product Method. 2.4. A Basic Problem in Optimal Design
- 3. Well-known Topological Structures of Interconnection Networks. 3.1. Hypercube Networks. 3.2. De Bruijn Networks. 3.3. Kautz Networks. 3.4. Double Loop Networks. 3.5. Other Topological Structures of Networks
- Publisher's Summary
- The advent of very large scale integrated circuit technology has enabled the construction of very complex and large interconnection networks. By most accounts, the next generation of supercomputers will achieve its gains by increasing the number of processing elements, rather than by using faster processors. The most difficult technical problem in constructing a supercom- puter will be the design of the interconnection network through which the processors communicate. Selecting an appropriate and adequate topological structure of interconnection networks will become a critical issue, on which many research efforts have been made over the past decade. The book is aimed to attract the readers' attention to such an important research area. Graph theory is a fundamental and powerful mathematical tool for de- signing and analyzing interconnection networks, since the topological struc- ture of an interconnection network is a graph. This fact has been univer- sally accepted by computer scientists and engineers. This book provides the most basic problems, concepts and well-established results on the topological structure and analysis of interconnection networks in the language of graph theory. The material originates from a vast amount of literature, but the theory presented is developed carefully and skillfully. The treatment is gen- erally self-contained, and most stated results are proved. No exercises are explicitly exhibited, but there are some stated results whose proofs are left to the reader to consolidate his understanding of the material.
(source: Nielsen Book Data)
- Supplemental links
Table of contents only
- Publication date
- by Junming Xu.
- Network theory and applications ; v. 7