Download Full eBooks in PDF
Some Contributions From Graph Theory To The Design And Study Of Large And Fault Tolerant Interconnection Networks Book in PDF, ePub and Kindle version is available to download in english. Read online anytime anywhere directly from your device. Click on the download button below to get a free pdf file of Some Contributions From Graph Theory To The Design And Study Of Large And Fault Tolerant Interconnection Networks book. This book definitely worth reading, it is an incredibly well-written.
Author : Ignacio Manuel Pelayo Melero
Publisher : Unknown
Page : 0 pages
File Size : 40,7 Mb
Release : 2000
Category : Electronic
ISBN : OCLC:807383088
Author : Lih-Hsing Hsu,Cheng-Kuan Lin
Publisher : CRC Press
Page : 720 pages
File Size : 52,9 Mb
Release : 2008-09-26
Category : 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 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.
Author : Junming Xu
Publisher : Springer Science & Business Media
Page : 352 pages
File Size : 47,5 Mb
Release : 2013-04-17
Category : Computers
ISBN : 9781475733877
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.
Author : J.-C. Bermond
Publisher : Elsevier
Page : 128 pages
File Size : 55,6 Mb
Release : 2016-06-06
Category : Mathematics
ISBN : 9781483295275
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.
Author : Neeraj Kumar Goyal,S. Rajkumar
Publisher : John Wiley & Sons
Page : 240 pages
File Size : 51,6 Mb
Release : 2020-10-28
Category : Computers
ISBN : 9781119620594
This book presents novel and efficient tools, techniques and approaches for reliability evaluation, reliability analysis, and design of reliable communication networks using graph theoretic concepts. In recent years, human beings have become largely dependent on communication networks, such as computer communication networks, telecommunication networks, mobile switching networks etc., for their day-to-day activities. In today's world, humans and critical machines depend on these communication networks to work properly. Failure of these communication networks can result in situations where people may find themselves isolated, helpless and exposed to hazards. It is a fact that every component or system can fail and its failure probability increases with size and complexity. The main objective of this book is to devize approaches for reliability modeling and evaluation of such complex networks. Such evaluation helps to understand which network can give us better reliability by their design. New designs of fault-tolerant interconnection network layouts are proposed, which are capable of providing high reliability through path redundancy and fault tolerance through reduction of common elements in paths. This book covers the reliability evaluation of various network topologies considering multiple reliability performance parameters (two terminal reliability, broadcast reliability, all terminal reliability, and multiple sources to multiple destinations reliability).
Author : Anonim
Publisher : Unknown
Page : 812 pages
File Size : 42,9 Mb
Release : 1986
Category : Power resources
ISBN : MINN:30000006286409
Author : Jose Duato,Sudhakar Yalamanchili,Lionel Ni
Publisher : Elsevier
Page : 624 pages
File Size : 46,5 Mb
Release : 2002-08-06
Category : Computers
ISBN : 9780080508993
The performance of most digital systems today is limited by their communication or interconnection, not by their logic or memory. As designers strive to make more efficient use of scarce interconnection bandwidth, interconnection networks are emerging as a nearly universal solution to the system-level communication problems for modern digital systems. Interconnection networks have become pervasive in their traditional application as processor-memory and processor-processor interconnect. Point-to-point interconnection networks have replaced buses in an ever widening range of applications that include on-chip interconnect, switches and routers, and I/O systems. In this book, the authors present in a structured way the basic underlying concepts of most interconnection networks and provide representative solutions that have been implemented in the industry or proposed in the research literature. * Gives a coherent, comprehensive treatment of the entire field * Presents a formal statement of the basic concepts, alternative design choices, and design trade-offs * Provides thorough classifications, clear descriptions, accurate definitions, and unified views to structure the knowledge on interconnection networks * Focuses on issues critical to designers
Author : Dimitris Sakavalas,Lewis Tseng
Publisher : Morgan & Claypool Publishers
Page : 153 pages
File Size : 47,9 Mb
Release : 2019-05-13
Category : Computers
ISBN : 9781681735672
As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-passing systems allows participants in the system to agree on a common value despite the malfunction or misbehavior of some components. It is a task of fundamental importance for distributed computing, due to its numerous applications. We summarize studies on the topological conditions that determine the feasibility of consensus, mainly focusing on directed networks and the case of restricted topology knowledge at each participant. Recently, significant efforts have been devoted to fully characterize the underlying communication networks in which variations of fault-tolerant consensus can be achieved. Although the deduction of analogous topological conditions for undirected networks of known topology had shortly followed the introduction of the problem, their extension to the directed network case has been proven a highly non-trivial task. Moreover, global knowledge restrictions, inherent in modern large-scale networks, require more elaborate arguments concerning the locality of distributed computations. In this work, we present the techniques and ideas used to resolve these issues. Recent studies indicate a number of parameters that affect the topological conditions under which consensus can be achieved, namely, the fault model, the degree of system synchrony (synchronous vs. asynchronous), the type of agreement (exact vs. approximate), the level of topology knowledge, and the algorithm class used (general vs. iterative). We outline the feasibility and impossibility results for various combinations of the above parameters, extensively illustrating the relation between network topology and consensus.
Author : Anonim
Publisher : Unknown
Page : 840 pages
File Size : 51,5 Mb
Release : 2009
Category : Dissertations, Academic
ISBN : STANFORD:36105132702593
Author : Anonim
Publisher : Unknown
Page : 252 pages
File Size : 48,5 Mb
Release : 1985
Category : Aeronautics, Military
ISBN : UIUC:30112105111204
Author : Anonim
Publisher : Institute of Electrical & Electronics Engineers(IEEE)
Page : 612 pages
File Size : 55,9 Mb
Release : 1996
Category : Parallel computers
ISBN : 0818676000
Author : Wei Song,Guangda Zhang
Publisher : CRC Press
Page : 302 pages
File Size : 40,7 Mb
Release : 2022-05-10
Category : Computers
ISBN : 9781000578836
Asynchronous On-Chip Networks and Fault-Tolerant Techniques is the first comprehensive study of fault-tolerance and fault-caused deadlock effects in asynchronous on-chip networks, aiming to overcome these drawbacks and ensure greater reliability of applications. As a promising alternative to the widely used synchronous on-chip networks for multicore processors, asynchronous on-chip networks can be vulnerable to faults even if they can deliver the same performance with much lower energy and area compared with their synchronous counterparts – faults can not only corrupt data transmission but also cause a unique type of deadlock. By adopting a new redundant code along with a dynamic fault detection and recovery scheme, the authors demonstrate that asynchronous on-chip networks can be efficiently hardened to tolerate both transient and permanent faults and overcome fault-caused deadlocks. This book will serve as an essential guide for researchers and students studying interconnection networks, fault-tolerant computing, asynchronous system design, circuit design and on-chip networking, as well as for professionals interested in designing fault-tolerant and high-throughput asynchronous circuits.
Author : Hung-Kuei Ku
Publisher : Unknown
Page : 280 pages
File Size : 43,8 Mb
Release : 1994
Category : Fault-tolerant computing
ISBN : UOM:39015033973036
Author : Anonim
Publisher : Unknown
Page : 1116 pages
File Size : 47,7 Mb
Release : 1994
Category : Mathematics
ISBN : UOM:39015051367566
Author : Calin Dan Morosan
Publisher : Unknown
Page : 0 pages
File Size : 46,5 Mb
Release : 2007
Category : Electronic
ISBN : OCLC:1108666739
The exponential growth of interconnection networks transformed the communication primitives into an important area of research. One of these primitives is the one-to-all communication, i.e. broadcasting. Its presence in areas such as static and mobile networks, Internet messaging, supercomputing, multimedia, epidemic algorithms, replicated databases, rumors and virus spreading, to mention only a few, shows the relevance of this primitive. In this thesis we focus on the study of interconnection networks from the perspective of two main problems in broadcasting: the minimum broadcast time problem and the minimum broadcast graph problem. Both problems are discussed under the 1-port constant model, which assumes that each node of the network can communicate with only one other node at a time and the transmitting time is constant, regardless of the size of the message. In the first part we introduce the minimum broadcast time function and we present two new properties of this function. One of the properties yields an iterative heuristic for the minimum broadcast time problem, which is the first iterative approach in approximating the broadcast time of an arbitrary graph. In the second part we give exact upper and lower bounds for the number of broadcast schemes in graphs. We also propose an algorithm for enumerating all the broadcast schemes and a random algorithm for broadcasting. In the third part we present a study of the spectra of Knödel graph and their applications. This study is motivated by the fact that, among the three known infinite families of minimum broadcast graphs, namely the hypercube, the recursive circulant, and the Knödel graph, the last one has the smallest diameter. In the last part we introduce a new measure for the fault tolerance of an interconnection network, which we name the global fault tolerance. Based on this measure, we make a comparative study for the above mentioned classes of minimum broadcast graphs, along with other classes of graphs with good communication properties.