313 research outputs found
Fault-tolerant interconnection networks for multiprocessor systems
Interconnection networks represent the backbone of multiprocessor systems. A failure in the network, therefore, could seriously degrade the system performance. For this reason, fault tolerance has been regarded as a major consideration in interconnection network design. This thesis presents two novel techniques to provide fault tolerance capabilities to three major networks: the Baseline network, the Benes network and the Clos network.
First, the Simple Fault Tolerance Technique (SFT) is presented. The SFT technique is in fact the result of merging two widely known interconnection mechanisms: a normal interconnection network and a shared bus. This technique is most suitable for networks with small switches, such as the Baseline network and the Benes network. For the Clos network, whose switches may be large for the SFT, another technique is developed to produce the Fault-Tolerant Clos (FTC) network. In the FTC, one switch is added to each stage. The two techniques are described and thoroughly analyzed
Recommended from our members
Indirect interconnection networks for high performance routers/switches
Routers form the backbone of the Internet; their kernel, structure, andconfiguration (scheduler) of the backplane (or switching fabrics) dominate the routers’performance, scalability, reliability and cost. As higher performance is required with therapid development of the network applications, router’s architecture has also evolvedfrom the shared backplane to switched backplane, which mainly uses the indirectinterconnection networks.The indirect interconnection networks include crossbar, MIN (multistageinterconnection networks) and some other irregular topologies. At present, most oftoday’s routers and switches are implemented on single crossbar with symmetric bufferarchitecture. In the first part of this dissertation, we introduce novel asymmetric bufferarchitecture for the crossbar in which a new port and a local shared bus are added. Wethen evaluate its performance and simulate under different bus arbitration and buffermanagement algorithms. Our studies indicate that we can get great improvement for thethroughput and low drop rate. Thus we could save a lot of expensive link bandwidth anddecrease the probability of congestion for the network.Single crossbar complexity increases at O(N2) in terms of crosspoint number,which become unacceptable for scalability as the port number (N) increases. A delta classself-routing MIN with complexity of O(N×log2N) has been widely used in the ATMswitches. But the reduction of crosspoint number results in considerable internal blocking.A number of scalable methods have been proposed to solve this problem. One of themuses more stages with recirculation architecture to reroute the deflected packets, whichgreatly increase the latency. In the second part of this dissertation, we propose aninterleaved multistage switching fabrics architecture and assess its throughput with ananalytical model and simulations. We compare this novel scheme with some previousparallel architectures and show its benefits. From extensive simulations under differenttraffic patterns and fault models, our interleaved architecture achieves better performancethan its counterpart of single panel fabric. Our interleaved scheme achieves speedups(over the single panel fabric) of 3.4 and 2.25 under uniform and hot-spot traffic patterns,respectively at maximum load (p=1). Moreover, the interleaved fabrics show greattolerance against internal hardware failures
Evaluation of Path Lengths in Proposed Triangle Network
Routing tag provides the algorithm to pass the data from source to destination in a network. In this paper Fault Tolerance of the proposed MIN Triangle has been analysed . All the path lengths available from source to destination have been found
A Complexity Analysis of Smart Pixel Switching Nodes for Photonic Extended Generalized Shuffle Switching Networks
This paper studies the architectural tradeoffs found in the use of smart pixels for nodes within photonic switching interconnection networks are discussed. The particular networks of interest within the analysis are strictly nonblocking extended generalized shuffle (EGS) networks. Several performance metrics are defined for the analysis, and the effect of node size on these metrics is studied. Optimum node sizes are defined for each of the performance metrics and system-level limitations are identified
Properties and algorithms of the (n, k)-star graphs
The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative
to the n-star topology in parallel computation. The (n, k )-star has significant
advantages over the n-star which itself was proposed as an attractive alternative to
the popular hypercube. The major advantage of the (n, k )-star network is its scalability,
which makes it more flexible than the n-star as an interconnection network. In
this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as
well as developing parallel algorithms that run on this network.
The basic topological properties of the (n, k )-star are first studied. These are
useful since they can be used to develop efficient algorithms on this network. We then
study the (n, k )-star network from algorithmic point of view. Specifically, we will
investigate both fundamental and application algorithms for basic communication,
prefix computation, and sorting, etc.
A literature review of the state-of-the-art in relation to the (n, k )-star network as
well as some open problems in this area are also provided
A systematic approach to reliable multistage interconnection network design
Bibliography: p. 34-35.Army Research Office grant no. DAAG29-84-K-0005 Advanced Research Projects Agency monitored by ONR, contract N00014-81-K-0742C.-C. Jay Kuo
Implementation of a Parallel Ynet Architecture
A simulation of an alternate implementation of a redundant busing network based on the Teradata Ynet architecture is presented. An overview of the Teradata DBC/1012 data base parallel processing computer including the Ynet, an active logic busing network, is given. Other multiprocessor busing networks are examined and compared to the standard Ynet and the alternate Ynet.
In the standard Ynet system, two networks, called Ynets, process message packets concurrently. When one of the Ynet paths fails, the system is reset. The remaining Ynet path restarts using the previously interrupted packets and processing continues without the aid of the failed Ynet. In the implementation presented here, the two busing networks process the message packets in parallel. Now, when one of the Ynet paths fails, the other continues processing the packets without interruption. This implementation can be referred to as a parallel Ynet.
The advantages and disadvantages of the parallel Ynet are discussed and suggestions for further research are given. Listings and sample outputs are included in the appendices
- …