In this paper, five different variants of interconnection networks such as Hypercube Network, Folded Hypercube Network, Multiply Twisted Hypercube Network, Recursive Circulant Hypercube Network and Multiple Reduced Hypercube Network are illustrated using Network Simulator and various physical and logical factors such as time, size of the packet, type of packet, speed, coverage and packet loss a...

Background : Clinical trials in medicine use probability -based statistics. Statistics separate the patient’s physiologic elements (specified as variables when given numeric form) from his or her body and define causal correlation for the group. Diagnostic and clinical decisions at the individual patient level are currently based on these definitions of causation. Because data is grouped and av...

Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for interconnecting the processors of distributed computing systems. The hypercube topology has drawn considerable attention due to many of its attractive properties. The appealing properties of the hypercube topology such a...

Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...

The popular hypercube interconnection network has high wiring(VLS1) complexity. The reduced hypercube (RH) is obtained by a uniform reduction in the number of channels for each hypercube node in order io reduce the VLSI complexity. It is known that the RH achieves performance comparable to that of the hypercube, at much lower hardware cost, through hypercube emulation. The reduced complexity of...

The linear complexity and the k-error linear complexity of a sequence are important security measures for key stream strength. By studying sequences with minimum Hamming weight, a new tool called hypercube theory is developed for p-periodic binary sequences. In fact, hypercube theory is very important in investigating critical error linear complexity spectrum proposed by Etzion et al. To demons...

We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal d...

In dynamic optimization problems with multiple continuous state variables and multiple continuous controls, the method of endogenous gridpoints (ENDG) generates an irregular collection of gridpoints for which standard interpolation techniques do not apply, while alternative interpolation methods are extremely slow. This paper presents an interpolation technique that allows ENDG to be used in mu...

A design 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 interconn...

In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter x degree). In addit...