Efficient sampling strategies that scale with the size of the problem, computational budget, and users’ needs are essential for various sampling-based analyses, such as sensitivity and uncertainty analysis. In this study, we propose a new strategy, called Progressive Latin Hypercube Sampling (PLHS), which sequentially generates sample points while progressively preserving the distributional pro...

Parallel routing and diameter are two important issues in interconnection networks. The hypercube is one of the most popular interconnection networks for parallel systems due to its attractive properties such as low diameter and efficient parallel routing. The exchanged hypercube, which is a variant of the hypercube by removing some specific edges, remains several desirable properties of the hy...

Advantages of hypercube network and torus topology are used to derive an embedded architecture for product network known as torus embedded hypercube scalable interconnection network. This paper analyzes torus embedded hypercube network pertinent to parallel architecture. The network metrics are used to show how good embedded network can be designed for parallel computation. Network parameter an...

Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k−step shrinking and expanding of a gray scale N×N image can be done in O (k) time on an N2 processor MIMD hypercube and in O (logN) time on an SIMD hypercube. Translation, rotation, and scaling of an N×N image take O (logN) time on an N2 processor h...

The boolean hypercube is a particularly versatile network for parallel computing. It is well known that multidimensional grid machines can be simulated on a hypercube with no communications overhead. In this paper it is shown that every bounded-degree tree can be simulated on the hypercube with constant communications overhead. In fact, the proof shows that every bounded-degree graph with an O(...

in this paper, the weighted szeged indices of cartesian product and corona product of twoconnected graphs are obtained. using the results obtained here, the weighted szeged indices ofthe hypercube of dimension n, hamming graph, c4 nanotubes, nanotorus, grid, t− fold bristled,sunlet, fan, wheel, bottleneck graphs and some classes of bridge graphs are computed.

Many theoretical-based comparison studies, relying on graph structural and algorithmic properties, have been conducted for the hypercube and the star graph. None of these studies, however, have considered real working conditions and implementation limits. We have compared the performance of the star and hypercube networks for different message lengths and number of virtual channels, and conside...

This paper introduces a new concept called routing functions, which have a close relation to one-to-many disjoint paths in networks. By using a minimal routing function, a maximal number of disjoint paths whose maximal length is minimized in the worst case can be constructed in the hypercube and the folded hypercube. The end nodes of the paths constructed for the hypercube are not necessarily d...