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 graph terminology, the book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.
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
Author: Lih-Hsing Hsu
Publisher: CRC Press
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.
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.
Author: Junming Xu
Publisher: Springer Science & Business Media
This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation.
J - C . Bermond , C. Delome , and J - J . Quisquater , " Strategies for interconnection networks : Some methods from graph theory ” , Journal of Parallel and Distributed Computing 3 ( 1986 ) , pp . 433-449 . 4.
Author: Derbiau Frank Hsu
Publisher: American Mathematical Soc.
Author: Jean-Claude Bermond
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.
Analogously, a graph G is defined to be super-k if every minimum node-cut set is trivial (the set of adjacent nodes of a ... Quisquater, Strategies for interconnection networks: Some methods from graph theory, J. Parallel Distribut.
Author: J.-C. Bermond
The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c
They have several graph theoretical properties which are ideal for the design of interconnection networks. These include large number of vertices, small vertex-regularity,vertex-symmetry and small diameter.
Author: Krishnaiyan "KT" Thulasiraman
Publisher: CRC Press
Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject. This growth has been largely due to the doyen of combinatorialists, Paul Erdős, whose penetrating insight and insatiable curiosity has provided a huge stimulus for workers in the field. There is hardly any branch of combinatorics that has not been greatly enriched by his ideas. This volume is dedicated to Paul Erdős on the occasion of his seventy-fifth birthday.
D-admissible extension of Kautz graphs Since the results are very similar for the other family of networks introduced ... Strategies for interconnection networks: some methods from graph theory, J. Parallel and Distributed Computing, 3, ...
Author: B. Bollobás
Author: Ignacio Manuel Pelayo Melero
Keeping in view the growth of the technological frontiers, there is always a need for the development of reliable, fault tolerant and cost- effective interconnection networks (INs) which are the critical metrics to achieve the goal of parallelism. The main objective of this book is to design new fault tolerant interconnection network layouts capable of path redundancy among dynamic failures. New INs designs are proposed and their observed results are found promising when compared with some of the earlier networks. The book also covers the reliability evaluation of various industrial network topologies considering multiple reliability performance parameters (2-TR, broadcast and ATR). Finally, the book also focuses on reliability evaluation and comparison of various topologies considering connectivity among multiple sources and multiple destinations (MSMT) nodes.
Hsu, L.H. and Lin, C.K., Graph theory and interconnection network, Taylor and Francis Group, CRC Press, Boca Raton, FL, 2008. 123. Yunus, N.A. and Othman, M., Reliability evaluation and routing integration in shuffle exchange omega ...
Author: Neeraj Kumar Goyal
Publisher: John Wiley & Sons
While typically many approaches have been mainly mathematics focused, graph theory has become a tool used by scientists, researchers, and engineers in using modeling techniques to solve real-world problems. Graph Theory for Operations Research and Management: Applications in Industrial Engineering presents traditional and contemporary applications of graph theory in the areas of industrial engineering, management science, and applied operations research. This comprehensive collection of research introduces the useful basic concepts of graph theory in real world applications.
Graph theory and interconnection networks. New York, NY: CR Press, Taylor & Francis Group. KEY TERMS AND DEFINITIONS Adjacency And Incidence: Two vertices connected to each other through an edge are called adjacent, and they are also ...
Author: Farahani, Reza Zanjirani
Publisher: IGI Global
Category: Technology & Engineering