Graph Theory and Interconnection Networks

Graph Theory and Interconnection Networks
Author: Lih-Hsing Hsu
Publisher: CRC Press
Total Pages: 722
Release: 2008-09-26
Genre: Computers
ISBN: 1420044826

The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to gra

Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks
Author: Junming Xu
Publisher: Springer Science & Business Media
Total Pages: 352
Release: 2013-04-17
Genre: Computers
ISBN: 1475733879

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.

Interconnection Networks

Interconnection Networks
Author: J.-C. Bermond
Publisher: Elsevier
Total Pages: 590
Release: 2016-06-06
Genre: Mathematics
ISBN: 1483295273

Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In particular, new constructions are proposed basedon different tools from discrete mathematics. Many new records have beenestablished in the table of the maximum number of vertices of graphs withmaximum degree &Dgr; and diameter D. Properties of thesenetworks (and of more classical ones) are analyzed in many of the otherpapers. About 40% of the articles deal with fault tolerance orvulnerability properties using either combinatorial tools or probabilisticones.

On Network Embeddings

On Network Embeddings
Author: R. Sundara Rajan
Publisher: LAP Lambert Academic Publishing
Total Pages: 160
Release: 2013
Genre:
ISBN: 9783659358869

Graph theory is becoming increasingly significant as it is applied to areas of mathematics and science & technology. It is being actively used in fields as varied as biochemistry, electrical engineering, computer science and operations research. Graph embedding is an important technique used in the study of computational capabilities of processor interconnection networks and task distribution. Embeddings of graphs from one class of graphs into another class have important applications in the field of computer science. In the design and implementation of parallel and distributed computing systems, one fundamental issue is the design of the interconnection network through which the computing elements can communicate efficiently. A measure of reliability and fault tolerance of the overall interconnection networks is given by the maximum number of nodes which can fail simultaneously without prohibiting other non-faulty nodes from communicating with others. In this work the authors discussed the embedding parameters such as dilation, congestion and wirelenth of certain interconnection networks. Further, they studied faulty interconnection networks.

Crossbar-Based Interconnection Networks

Crossbar-Based Interconnection Networks
Author: Mohsen Jahanshahi
Publisher: Springer
Total Pages: 171
Release: 2018-04-10
Genre: Computers
ISBN: 3319784730

This unique text/reference provides an overview of crossbar-based interconnection networks, offering novel perspectives on these important components of high-performance, parallel-processor systems. A particular focus is placed on solutions to the blocking and scalability problems. Topics and features: introduces the fundamental concepts in interconnection networks in multi-processor systems, including issues of blocking, scalability, and crossbar networks; presents a classification of interconnection networks, and provides information on recognizing each of the networks; examines the challenges of blocking and scalability, and analyzes the different solutions that have been proposed; reviews a variety of different approaches to improve fault tolerance in multistage interconnection networks; discusses the scalable crossbar network, which is a non-blocking interconnection network that uses small-sized crossbar switches as switching elements. This invaluable work will be of great benefit to students, researchers and practitioners interested in computer networks, parallel processing and reliability engineering. The text is also essential reading for course modules on interconnection network design and reliability.

Interconnection Networks

Interconnection Networks
Author: Jean-Claude Bermond
Publisher:
Total Pages: 581
Release: 1992-01-01
Genre: Mathematics
ISBN: 9780444893420

Most of the articles in this book deal with static or point-to-point Interconnection Networks. In particular, new constructions are proposed based on different tools from discrete mathematics. Many new records have been established in the table of the maximum number of vertices of graphs with maximum degree Dgr; and diameter D . Properties of these networks (and of more classical ones) are analyzed in many of the other papers. About 40% of the articles deal with fault tolerance or vulnerability properties using either combinatorial tools or probabilistic ones.