A Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture

Kini, Gopalakrishna N; Kumar, M. Sathish; Mruthyunjaya, H.S

doi:10.1109/iadcc.2009.4809127

Cited by 13 publications

(12 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To illustrate, let's consider π= (14,7,0,13,2,11,4,1,8,3,9,10,12,15,6,5) which is the inverse of the permutation (2,7,4,9,6,15,14,1,8,10,11,5,12,3,0,13). It can be easily verified that the routing paths of π by successive moves in dimension 0 of the suitable messages are the ones given in Table 7.…”

Section: Optimal Routing Of Inverse Omega Permutationsmentioning

confidence: 99%

“…The partition of π in dimension 3 is realised by the perfect matching Γ=(0, 1,2,11,4,13,14,7,8,9,10,3,12,5,6,11) induced by the boldfaced "1" of Table 5. Table 5.…”

Section: Algorithmmentioning

confidence: 99%

“…They have also been used as a means of interconnecting and extending switching matrices in ATM cross connects [3] or proposed as a model for new ATM switches with low complexity and high performance [4]. Nowadays, they continue to be an attractive solution for multicore processor IN [5]. On the other side, several theoretical research works like the one in [6] have been done on different aspects of their use as IN.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes

Jung¹,

Sakho²

2011

NPA

View full text Add to dashboard Cite

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 of the optimal routing of omega and inverse-omega permutations on hypercubes under the MIMD queueless communication model. We revisit the problem through a new paradigm: the so-called graphs partitioning in order to take advantage of the recursive structure of the hypercubes topology. We prove that omega and inverse-omega permutations are partitionable. That is any omega (resp. inverse-omega) permutation on n-dimensional hypercube can be decomposed in two independent permutations on two disjoint (n-1)-dimensional hypercubes. We also prove that each one of these permutations is also an omega (resp. inverse-omega) permutation. It follows that any omega (resp. inverse-omega) permutation on n-dimensional hypercube is routable in at most n steps of data exchanges, each step realizing the partition of the hypercube.

show abstract

Section: Optimal Routing Of Inverse Omega Permutationsmentioning

confidence: 99%

“…The partition of π in dimension 3 is realised by the perfect matching Γ=(0, 1,2,11,4,13,14,7,8,9,10,3,12,5,6,11) induced by the boldfaced "1" of Table 5. Table 5.…”

Section: Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes

Jung¹,

Sakho²

2011

NPA

View full text Add to dashboard Cite

show abstract

“…In asymmetric systems the number of links across the bisection depends on where the bisection is drawn. However, since the bisection bandwidth is a worst case metric, the bisection leading to the smallest bisection bandwidth should be chosen [9]. Where the number of links L for different networks (OC 3 N and OHC 2 N) are given by:…”

Section: 2 Optical Hypercube Connected Clustermentioning

confidence: 99%

“…The intercluster crossbar connecting clusters are arranged in a hypercube configuration [9]. The OHC 2 N does not impose a fully connected topology, but efficient use of WDM allows construction of very large-scale (thousands of processors) networks at a reasonable cost [9]. network.…”

Section: 2 Optical Hypercube Connected Clustermentioning

confidence: 99%

Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks

Rashed¹

2012

IJCNIS

View full text Add to dashboard Cite

Abstract-The need for scalable systems in market demands in terms of lower computing costs and protection of customer investment in computing: scaling up the system to quickly meet business growth is obviously a better way of protecting investment: hardware, software, and human resources. A scalable system should be incrementally expanded, delivering linear incremental performance with a near linear cost increase, and with minimal system redesign (size scalability), additionally, it should be able to use successive, faster processors with minimal additional costs and redesign (generation scalability). On the architecture side, the key design element is the interconnection network. The interconnection network must be able to increase in size using few building blocks and with minimum redesign, deliver a bandwidth that grows linearly with the increase in system size, maintain a low or (constant) latency, incur linear cost increase, and readily support the use of new faster processors. The major problem is the ever-increasing speed of the processors themselves and the growing performance gap between processor technology and interconnect technology. Increased central processing unit (CPU) speeds and effectiveness of memory latency-tolerating techniques.

show abstract

Data Concentration on Torus Embedded Hypercube Network

Sinha¹,

Jha

Mandal³

2014

Advanced Computing, Networking and Informatics- Volume 2

View full text Add to dashboard Cite

A Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture

Cited by 13 publications

References 3 publications

A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes

A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes

Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks

Data Concentration on Torus Embedded Hypercube Network

Contact Info

Product

Resources

About