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

The Hypercube Neural Network Algorithm is a novel supervised method for classification. One hypercube is defined per class in the attribute space based on the training data. Each dimension of a hypercube is set to cover the full range of values in the class. The hypercube learning is therefore a rapid, one-shot form of learning. This paper presents three versions of the algorithm: hypercube wit...

This paper analyzes a product network generated from torus and hypercube networks known as Torus embedded hypercube scalable interconnection network suitable for parallel architecture. It is shown here that how good a Torus embedded Hypercube interconnection network can be compared to the existing Mesh embedded hypercube interconnection network with minor modifications in its architecture. A co...

In this paper we present how to reconfigure dynamically a complete binary tree in faulty hypercubes. First, we use a dynamic algorithm to reconfigure a complete binary tree of height h (h≥0) in an (h+1)-dimensional faulty hypercube. If there is a faulty node in the hypercube, both the dilation and congestion are 2 after reconfiguration. If there are two faulty nodes in the hypercube, both the d...