A Comparative Study of Interconnection Network (original) (raw)

The Folded Crossed Cube : A New Interconnection Network For Parallel Systems

International …, 2010

Study of parallel computer interconnection network topology has been made along with the various interconnection networks emphasizing the cube based topologies in particular. This paper proposes a new cube based topology called the Folded crossed cube with better features such as reduced diameter, cost and improved broadcast time, better fault tolerance and better message traffic density in comparison to its parent topologies: viz: hypercube and crossed cube. The one-to-one routing algorithm is also designed for the proposed network. The topological properties along with routing time are compared with the parent topologies and found to be better. Performance analysis in terms of cost, reliability is also done for the current network.

Performance Analysis of k-Ary n-Cube Interconnection Networks

IEEE Transactions on Computers, 1990

Abstmct-VLSI communication networks are wire-limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection are derived that agree closely with experimental measurements. It is shown that low-dimensional networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width.

On the design of hypermesh interconnection networks for multicomputers

Journal of Systems Architecture, 2000

Topology, routing algorithm, and router structure are among the most important factors that greatly in¯uence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a speci®c routing algorithm and complex routers to take advantage of its rich connectivity.

A new hierarchy of hypercube interconnection schemes for parallel computers

The Journal of Supercomputing, 1988

This paper introduces a new hierarchy of cube-based interconnection schemes, called the base-b cube (which properly contains the well-known binary cube), for the design of parallel computers. This hierarchy admits a recursive definition and allows many more reconfigurations than are possible with the binary cube. Our analysis addresses the inherent cost-delay trade-off for this hierarchy along with a number of related topological properties such as sparsity, diameter, existence of node disjoint paths, and odd and even cycles. Embeddings of standard interconnection schemes including linear and two-dimensional arrays, rings, and complete binary trees in a base-b cube are illustrated.

The chained-cubic tree interconnection network

Int Arab J Inform Technol, 2011

The core of a parallel processing system is the interconnection network by which the system's processors are linked. Due to the great role played by the interconnection network's topology in improving the parallel processing system's performance, various topologies have been proposed in the literature. This paper proposes a new interconnection network topology, referred to as the chained-cubic tree, in which chains of hypercubes are arranged in a tree structure. The major topological properties of the proposed topology have been investigated, including its diameter, degree, connectivity, bisection width, size, cost, and hamiltonicity. A comparative study is then conducted between the proposed CCT and other interconnection networks' topologies, including tree and hypercube in order to evaluate the rank occupied by CCT among other well-known topologies in terms of various performance and cost metrics. The concluding results proved that the CCT topology overcomes the shortcomings of its progenitors, tree and hypercube, while keeping most of its appealing properties.

On the performance of multicomputer interconnection networks

Journal of Systems Architecture, 2004

Several researchers have analysed the performance of k-ary n-cubes taking into account channel bandwidth constraints imposed by implementation technology, namely the constant wiring density and pin-out constraints for VLSI and multiple-chip technology respectively. For instance, Dally [IEEE Trans. Comput. 39(6) (1990) 775], Abraham [Issues in the architecture of direct interconnection networks schemes for multiprocessors, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1992], and Agrawal [IEEE Trans. Parallel Distributed Syst. 2(4) (1991) 398] have shown that lowdimensional k-ary n-cubes (known as tori) outperform their high-dimensional counterparts (known as hypercubes) under the constant wiring density constraint. However, Abraham and Agrawal have arrived at an opposite conclusion when they considered the constant pin-out constraint. Most of these analyses have assumed deterministic routing, where a message always uses the same network path between a given pair of nodes. More recent multicomputers have incorporated adaptive routing to improve performance. This paper re-examines the relative performance merits of the torus and hypercube in the context of adaptive routing. Our analysis reveals that the torus manages to exploit its wider channels under light traffic. As traffic increases, however, the hypercube can provide better performance than the torus. Our conclusion under the constant wiring density constraint is different from that of the works mentioned above because adaptive routing enables the hypercube to exploit its richer connectivity to reduce message blocking.

Star varietal cube : A New Large Scale Parallel Interconnection Network

2011

This paper proposes a new interconnection network topology, called the Star varietalcube SVC(n,m), for large scale multicomputer systems. We take advantage of the hierarchical structure of the Star graph network and the Varietal hypercube to obtain an efficient method for constructing the new topology. The Star graph of dimension n and a Varietal hypercube of dimension m are used as building blocks. The resulting network has most of the desirable properties of the Star and Varietal hypercube including recursive structure, partionability, strong connectivity. The diameter of the Star varietal hypercube is about two third of the diameter of the Star-cube. The average distance of the proposed topology is also smaller than that of the Star-cube.

An Innovative Topologies Based on Hypercube Network Interconnection

European Journal of Information Technologies and Computer Science

A parallel processing system's most crucial part is a network interconnection that links its processors. The hypercube topology has interesting features that make it a great option for parallel processing applications. This paper presents two innovative configurations of interconnection networks based on fractal Sierpinski and a hypercube. These are called the Sierpinski Triangle Topology (STT) and Sierpinski Carpet Topology (SCT). Compared to a hypercube, the Sierpinski Triangle topology (STT) noticed a significant decrease in the number of nodes and links as large networks grew. Hence, it is considered a great way to reduce costs because it uses fewer nodes and links. The average distance is also shorter, which is better. Despite it having a smaller bisection width and a higher degree than a hypercube by one. The Sierpinski Carpet Topology (SCT) has the advantage of having a high bisection width compared to a hypercube. That is preferable because it places a lower restriction ...

Folded Dualcube: A New Interconnection Topology for Parallel Systems

2008

With the advent of VLSI technology, the demand for higher processing has increased to a large extent. Study of parallel computer interconnection topology has been made along with the various interconnection networks emphasizing the cube based topologies in particular. This paper proposes a new cube based topology called the Folded dualcube with better features such as reduced diameter, cost and improved broadcast time in comparison to its parent topologies: viz: Folded hypercube and Dualcube. Two separate routing algorithms one-to-one and one-to-all broadcast have been proposed for the new network.