Interconnection Networks
Published on 21. August 1992
Book
Hardback
590 pages
978-0-444-89342-0 (ISBN)
Description
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 Delta 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.
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 Delta 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.
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 Delta 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.
More details
Series
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Elsevier Science & Technology
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 230 mm
ISBN-13
978-0-444-89342-0 (9780444893420)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Content
New (DeltaD) Graphs Discovered by Heuristic Search. Transmitting in the n -Dimensional Cube. A Survey of Integrity. Connections between Two Cycles - A New Design of Dense Processor Interconnection Networks (INs). Design and Analysis of Fault-Tolerant Multibus INs. Dense Group Networks. Graphs with Small Diameter After Edge Deletion. New Methods for Using Cayley Graphs in INs. Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. The Forwarding Index of Communication Networks with Given Connectivity. Examples of Products Giving Large Graphs with Given Degree and Diameter. Connectivity of Consecutive- d Digraphs. Generalized Degrees and Menger Path Systems. A New Look at the de Bruijn Graph. Connectivity, Persistence and Fault Diagnosis of INs based on Ok and 2 Ok Graphs. Graphs on Alphabets as Models for Large INs. Analysis of Minimal Path Routing Schemes in the Presence of Faults. Changing and Unchanging the Diameter of a Hypercube. The Connectivity of Hierarchical Cayley Digraphs. Perfect Latin Squares. Forwarding Indices of k -Connected Graphs. Broadcasting and Spanning trees in the de Bruijn and Kautz Networks. Nonblocking Self-Routing Switching networks. An Improved Upper Bound for the Subarray Partial Concentrators. Diameters of Cubic Graphs. Some Large Trivalent Graphs having Small Diameters. Cost-Performance Tradeoffs for INs. Broadcasting in DMA-Bound Bounded Degree Graphs. Minimum Broadcast Digraphs. Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. The Asymptotic Optimality of Spider-Web Networks. Heuristics for the Steiner Problem in Graphs. Product Shuffle-Networks: Towards Reconciling Shuffles and Butterflies. Generating the States of a Binary Stochastic System. The Covering Radius of Hadamard Codes in Odd Graphs. Super Edge-Connectivity of Dense Digraphs and Graphs. The Underlying Graphs of a Line Digraph. Efficient Fault-Tolerant Fixed Routing on (k+1)-Connected Digraphs. Application of Coding Theory to INs. Chordal Rings as Fault-Tolerant Loops. Tables of Large ( ,D)-Graphs. Author Index.