Hypercube Interconnection Network Research Articles

Performance Analysis of Interconnection Networks Using a Novel Metric

Multiprocessor is a handling device within any event with two preparing units sharing the access. The primary reason for employing the multiprocessor includes dealing with undertakings during a consistent way while as yet supporting the framework's performance. Interconnection Networks are hub to hub associations produced using single processor or a gaggle of processing units. These connections permit data to be moved from one processor to resulting or from memory to processor, permitting the errand to be isolated and assessed similarly. Hypercube frameworks are a sort of device topography that connects various processing units with the memory modules and correctly course the data. Hypercubes are frequently seen as a chart with hubs and edges, with every hub including a processing unit and each link addressing a relation among the processing units to send information. In this paper, a bunch of multiprocessor interconnection network designs are thought of and their performance is assessed with the help of a totally extraordinary proposed metric. The normal upsides of the boundaries like diameter, degree, speed, inclusion of hubs, and loss of packets at that point on are considered to arrive at the proposed metric "Performance Index" with the help of a legitimized weight metric. Non-linear regression system is utilized to assess the exact upsides of the performance index of different multiprocessor hypercube interconnection networks. These qualities are contrasted with a summary of the productive variation reasonable for a wide choice of multiprocessing applications.

Number Theoretic Model of Concurrent Access in Hypercube Interconnection Network

Abstract: This paper proposes a mathematical logical model to use shared communication links in the hypercube interconnection network. To achieve our objective we have used the orthogonal property of binary coding used to label the processing nodes of the hypercube and applied binary coding based multiplexing technique and the XOR logic operation to separate the individual processing nodes data from the multiplexed signal. Keywords: Gray codes, Hypercube, 1’s complement logic, GIG codes, bipolar codes, orthogonal codes, Normalized inner product, Parallel computing System.

Fault Tolerance of Optical Hypercube Interconnection Networks with r‐Communication Pattern

As power grids and optical interconnection networks are interdependent, the reliabilities of the optical networks are critical issues in power systems. The optical networks hold prominent performance including wide bandwidth, low loss, strong anti‐interference capability, high fidelity, and reliable performance. They are regarded as promising alternatives to electrical networks for parallel processing. This paper is aimed at taking the first step in understanding the communication efficiencies of optical networks. For that purpose, on optical networks, we propose a series of novel notions including communication pattern, r‐communication graph, reduced diameter, enhanced connectivity, r‐diameter, and r‐connectivity. Using these notions, we determine that the r‐diameter and r‐connectivity of the optical n‐dimensional hypercube network are ⌈n/r⌉ and , respectively. Since the parameter r is variable, we can adjust different values of r on the basis of the wavelength resources and load of the optical networks, achieving enhanced communication efficiencies of these networks. Compared with the electric n‐dimensional hypercube network, the proposed communication pattern on the optical hypercube network not only reduces the maximum communication delay of the conventional electrical hypercube significantly but also improves its fault tolerance remarkably.

An Efficient Exchanged Hyper Cube for Parallel and Distributed Network

Enormously parallel distribution memory designs are accepting and expanding regard to satisfy the expanding need on processing power. Numerous topologies have been projected for interconnecting the processors of distributed computing systems. The hypercube topology has attracted significant consideration because of a significant number of attractive properties. The engaging properties of the hypercube topology, for example, vertex and edge balance, recursive structure, logarithmic diameter, maximally fault-tolerance, simple routing and broadcasting, and the capacity to recreate other interconnection systems with least overhead have made it a brilliant possibility for some parallel processing applications. Numerous varieties of the hypercube topology have been accounted for the literature, mostly to add the computational power of the hypercube. One of the gorgeous versions of the hypercube was introduced for the improvement of the presented Exchanged hypercube. An Exchanged hypercube has the equivalent structural complexities of the hypercube. It protects the gorgeous properties of the hypercube and diameter the communication time by dropping the diameter by a factor of two. This paper presents the fundamental communication and some of the essential operations normally required in parallel computing on the Exchanged hypercube interconnection networks.

Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network

Travelling Salesman Problem (TSP) is one of the most popular NP-complete problems for the researches in the field of computer science which focused on optimization. TSP goal is to find the minimum path between cities with a condition of each city must to visit exactly once by the salesman. Grey Wolf Optimizer (GWO) is a new swarm intelligent optimization mechanism where it success in solving many optimization problems. In this paper, a parallel version of GWO for solving the TSP problem on a Hypercube Interconnection Network is presented. The algorithm has been compared to the alternative algorithms. Algorithms have been evaluated analytically and by simulations in terms of execution time, optimal cost, parallel runtime, speedup and efficiency. The algorithms are tested on a number of benchmark problems and found parallel Gray wolf algorithm is promising in terms of speed-up, efficiency and quality of solution in comparison with the alternative algorithms.

Dynamic Scheduling Algorithm for Variants of Hypercube Interconnection Networks

Objectives: Topropose analgorithm for better performance interms of scheduling and the network usage is economical. Method/Statistical Analysis: The dynamic task scheduling algorithm has been proposed for scheduling the load on numerous cube based multiprocessor interconnection networks. Especially the efficiency of the proposed algorithm is examined in terms of performance parameters for instance Load Imbalance Factor’s as well as Execution Time for cube based multiprocessor networks; Nevertheless, a comparison is created with other standard scheduling algorithm. Findings:The comparative simulation study shows that the proposed algorithm gives better performance in terms of task scheduling on various cube based multiprocessor networks. Application: The study in such a direction implies that the variety of processors in folded hypercube has been decreased thus minimizing the cost as well as intricacy of the network without reducing the efficiency of the network. Therefore, a combination of scalable folded hypercube architecture and efficient proposed algorithm is a better organization model that supports variety of informatics applications.

A Comparatively Analysis and Performance of Logical Topologies of Embedded Hypercube (LTOEH) Interconnection Network

A Comparatively Analysis and Performance of Logical Topologies of Embedded Hypercube (LTOEH) Interconnection Network

A Framework for Embedded Hypercube Interconnection Networks: Based on Neural Network Approach

paper is concerned with routing of data in an embedded hypercube interconnection using the approach based on neural net architecture. To present a framework of the interconnection network consist number of nodes and number of connections. In this paper we first show that n dimensional hypercube can be embedded in layer neural layer network such that for any node of hypercube, its neighboring nodes of other layer are evenly partition into layers where each layer shares a manipulating or resulting data of different layers. Under this embedding network to fixed target and varying data input to produce output of the two incidence matrix of k- ary n-cube network to embedded in architecture.

A Statistical Analysis and Comparatively Study of Embedding Hypercube

Consider the K-arry n-cube network is the most significant network structure in parallel computer architecture. Therefore the generic structure of K-arry n-cube used to design the various networks with static network topology of different parameters, and its makes different types hypercube networks (N=2 ) from static networks known as embedded hypercube scalable inter-PE connection network suitable for parallel computing systems. Show how to design the good interconnection network in parallel Architecture for less density as well as diameter to route the data to different path. Also it has been proved with the computational results of entire system that the embedded hypercube interconnection networks built is highly scale up in terms of communication. A complete design analysis and comparison of network with various other networks is given using different network parameters, and statistical analysis comparative optimal of torus architecture rather than mesh architecture.

Universal Functional Block Design for All Purpose Network Realization in Multi-core System

while the last 30 years has seen the computer industry driven primarily by faster uni-processors those days have come to an end. Emerging in their place are multi processors containing multiple processor cores that are expected to exploit parallelism (3), (4). High reliability, availability and scalability (2)needs efficient multistage switching network to ensure performance (throughput) improvement. Current advancement in IC technology has helped us to design Universal Block for these different interconnection networks. Here in this paper we have designed a Universal Block for hypercube interconnection network using two different approaches indirect hypercube switching and shuffle exchange switching simultaneously. Index Terms: Universal Functional Block, Indirect Hypercube, Shuffle Exchange, Omega switching.

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes

The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. An HHC can connect many nodes while retaining a low degree and a small diameter. It is thus a suitable topology for interconnection networks of massively parallel systems. We describe in this paper an algorithm solving the set-to-set disjoint-path routing problem in perfect HHCs. In an HHC2m+m, given two sets of m+1 nodes S and D, the proposed algorithm can find m+1 node-disjoint paths between the nodes of S and the nodes of D of lengths at most (m+1) (2m + m + 4) + 3 in O(m2 22m) time complexity.

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes

The perfect hierarchical hypercube (HHC) interconnection network, also known as the cube-connected cube, was introduced as a topology for large parallel computers. One of its interesting properties is that it can connect many nodes while retaining a small diameter and a low degree. The first node-to-set disjoint-path routing algorithm in perfect HHCs was previously introduced by Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Japan, June 1–3. Elsevier, Amsterdam]. In this paper, we propose a novel solution to the node-to-set disjoint-path routing problem in HHC. Inside a (2m + m)-dimensional HHC, we shall describe an algorithm that can find disjoint paths between a source node and at most m + 1 destination nodes of maximum length O(2m), significantly shorter than the maximum path length O(m2m) of Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Singapore, June 1–3. Elsevier, Amsterdam].

Torus Embedded Hypercube Interconnection Network: A Comparative Study

analysis and comparison of a product network generated from torus and hypercube networks known as torus embedded hypercube scalable interconnection network suitable for parallel computers is presented in this paper. It is shown here that with minor modifications in architecture of the existing mesh embedded hypercube interconnection network how good a torus embedded hypercube interconnection network could be. Also it has been proved with the computational results that the torus embedded hypercube interconnection network is highly scalable and more efficient in terms of communication.

Adaptive routing in wormhole-switched necklace-cubes: Analytical modelling and performance comparison

The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties, VLSI and algorithmic aspects of this network. Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems. This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most effective for necklace hypercube networks. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions.

THE COMMUNICATION MACHINE

The Communication Machine brings to the multicomputer what vectorization brought to the uniprocessor. It provides the same tools to speed communication that have traditionally been used to speed computation; namely, the capability to program optimal communication algorithms on an architecture that can, to the extent possible, replicate their performance in terms of wall-clock time. In addition to the usual complement of logic and arithmetic units, each module contains a programmable communication unit that orchestrates traffic between the network and registers that communicate directly with comparable registers in neighboring modules. Communication tasks are performed out of these registers like computational tasks on a vector uniprocessor. The architecture is balanced in the sense that, on average, the speed of local and global memory is comparable. Theoretical performance is tabulated for both hypercube and mesh interconnection networks. The Communication Machine returns to the somewhat beleaguered, yet intuitive concept that the performance we ultimately seek must come from a truly massive number of processors.

An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors

This paper proposes a simple yet efficient algorithm to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. This algorithm was developed based upon the well-known dimension exchange method. However, the error accumulation suffered by other algorithms based on the dimension exchange method is avoided by exploiting the notion of regular distributions, which are commonly deployed for data distributions in parallel programming. This algorithm achieves a perfect load balance over P processors with an error of 1 and the worst-case time complexity of O(M log2P), where M is the maximum number of tasks initially assigned to each processor. Furthermore, perfect load balance is achieved over subcubes as well—once a hypercube is balanced, if the cube is decomposed into two subcubes by the lowest bit of node addresses, then the difference between the numbers of the total tasks of these subcubes is at most 1.

Evaluating the communications capabilities of the generalized hypercube interconnection network

SUMMARY This paper presents results of evaluating the communications capabilities of the generalized hypercube interconnection network. The generalized hypercube has outstanding topological properties, but it has not been implemented on a large scale because of its very high wiring complexity. For this reason, this network has not been studied extensively in the past. However, recent and expected technological advancements will soon render this network viable for massively parallel systems. We first present implementations of randomized manyto-all broadcasting and multicasting on generalized hypercubes, using as the basis the oneto-all broadcast algorithm presented by Fragopoulou et al. (1996). We test the proposed implementations under realistic communication traffic patterns and message generations, for the all-port model of communication. Our results show that the size of the intermediate message buffers has a significant effect on the total communication time, and this effect becomes very dramatic for large systems with large numbers of dimensions. We also propose a modification of this multicast algorithm that applies congestion control to improve its performance. The results illustrate a significant improvement in the total execution time and a reduction in the number of message contentions, and also prove that the generalized hypercube is a very versatile interconnection network. Copyright © 1999 John Wiley & Sons, Ltd.

Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks

The surviving route graph R(G, ρ)/F for a graph G, a routing ρ and a set of failures F is a graph consisting of all non-faulty vertices of G and with an edge between two vertices if there are no failures in the routing between the two vertices. Numerous papers have studied the diameter of R(G, ρ)/F as a measure of the fault-tolerance of G and ρ, assuming that the cardinality of F is strictly smaller than the connectivity of G. In this paper we study the diameter of R(G, ρ)/F, when G is either the n-star graph or the n-dimensional hypercube and ρ is any minimal length routing, under the assumption that F is any set of failures not containing all the neighbours of any vertex and |F| is at most twice the connectivity of G minus 3.

A technique for overlapping computation and communication for block recursive algorithms

SUMMARY This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory architecture with a circuit-switched or wormhole routed mesh or a hypercube interconnection network. A mathematical framework based on the tensor product and other matrix operations is used for representing algorithms. Communication-efficient implementations with effectively overlapped computation and communication are achieved by manipulating the mathematical representation using the tensor product algebra. Performance results for FFT programs on the Intel Paragon are presented. ©1998 John Wiley & Sons, Ltd.

A Super-cube Interconnection NetworkFor Parallel Computers

In this paper, we consider some interconnection networks for parallel computers. Let d be the greatest distance in a network, and let / be the maximum number of circuits connected from optional processor. It is well known, for the hypercube interconnection network, d = Iog2%, / = Iog2?%, where n is the number of processors in the network. In this paper, we present a super-cube interconnection network for parallel computers. For this new interconnection network, d and / both satisfies d < 0.86 logg n and / < 0.86 log n.