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...

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...

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...

Hypercube structures are heavily used by parallel algorithms that require all-to-all communication. When communicating over a heterogeneous network, which may be the case in NOWs or GRID environments, the performance obtained by the hypercube structure will depend on the matching of the hypercube structure to the topology of the underlying network. In this paper, we present strategies to build ...

We propose an approach to constructing nested Latin hypercube designs. Such designs are useful for conducting multiple computer experiments with different levels of accuracy. A nested Latin hypercube design with two layers is defined to be a special Latin hypercube design that contains a smaller Latin hypercube design as a subset. Our method is easy to implement and can accommodate any number o...

The purpose of embedding (or mapping) is to minimize the communication overhead of parallel algorithms. It appears unlikely that an efficient exact technique of embedding a general guest graph in a general host graph with a minimum-dilation will ever be found. The Research in this area is concentrating on discovering efficient heuristic that find solution in most cases. This article is a survey...

Hypercube structures are heavily used by parallel algorithms that require all-to-all communication. When communicating over a heterogeneous and irregular network, the performance obtained by the hypercube structure will depend on the matching of the hypercube structure to the topology of the underlying network. In this paper, we present strategies to build topology-based hypercubes structures. ...