Optimal Self { Routing of Linear - Complement Permutations in Hypercubes 1
نویسنده
چکیده
Optimal Self{Routing of Linear-Complement Permutations in Hypercubes1 Rajendra Boppana and C. S. Raghavendra Dept. of Electrical Engineering{Systems University of Southern California, Los Angeles, CA 90089{0781 Abstract In this paper we describe an algorithm to route the class of linear-complement permutations on Hypercube SIMD computers. The class of linearcomplement permutations are extremely useful in devising storage schemes for parallel array access. The proposed algorithm is self-routing and minimal, that is, the path established by the algorithm between each pair of source and destination processors is via a minimal path using only the destination processor address. Furthermore, the algorithm requires only the optimal number of routing steps to realize any linearcomplement permutation. The best known previous routing algorithms for the Hypercubes are for the class of bit-permute-complement permutations, a subset of the class of linear-complement permutations. Those algorithms are either non-optimal or not self-routing. The algorithm presented is self-routing, optimal, and it routes a larger class of permutations. Also, this algorithm can route the class of linear-complement permutations in multi-dimensional meshes in optimal number of routing steps.
منابع مشابه
Optimal Self Routing of Linear Complement Permutations in Hypercubes
In this paper we describe an algorithm to route the class of linear complement permutations on Hy percube SIMD computers The class of linear complement permutations are extremely useful in de vising storage schemes for parallel array access The proposed algorithm is self routing and minimal that is the path established by the algorithm between each pair of source and destination processors is v...
متن کاملA New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes
Omega permutations constitute the subclass of particular permutations which have gained the more attention in the search of optimal routing of permutations in hypercubes. The reason of this attention comes from the fact that they are permutations for general-purpose computing like the simultaneous conflict-free access to the rows or the columns of a matrix. In this paper we address the problem ...
متن کاملOptimal Processor Mapping for Linear-Complement Communication on Hypercubes
ÐIn this paper, we address the problem of minimizing channel contention of linear-complement communication on wormholerouted hypercubes. Our research reveals that, for traditional routing algorithms, the degree of channel contention of a linearcomplement communication can be quite large. To solve this problem, we propose an alternative approach, which applies processor reordering mapping at com...
متن کاملOn The Rearrangeability Of Hypercubes Networks Characterization Of Some Non-1-Partitionable Permutations On 4D-hypercubes
This paper addresses the problem of the nDhypercubes interconnection networks rearrangeability that is the capability of such networks to route optimally arbitrary permutations under queueless communication constraints. The k-partitioning is an unifying paradigm of such routing. For a permutation which is not constituted of two sub-permutations on two disjoint (n-1)D-hypercubes of the nD-hyperc...
متن کاملCongestion-free routing of linear permutations on Fibonacci and Lucas cubes
In recent years there has been much interest in certain subcubes of hypercubes, namely Fibonacci cubes and Lucas cubes (and their generalized versions). In this article we consider off-line routing of linear permutations on these cubes. The model of routing we use regards edges as bi-directional, and we do not allow queues of length greater than one. Messages start out at different vertices, an...
متن کامل