Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks

Phisutthangkoon, Nuntipat; Werapun, Jeeraporn

doi:10.1016/j.jpdc.2021.01.004

Cited by 7 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has a smaller number of links than the comparable hypercube, has multiple levels of hierarchy and the node degree increases proportionally as the hierarchy levels. In [40], HHC network is used to implement all-to-all personalized communication through parallel node-to-node shortest-path routing and proper HHC-partitioning. In [41], all-to-all personalized exchange communication is used to confirm the efficacy of the proposed reconfigurable-and-partitionable HHC.…”

Section: Related Workmentioning

confidence: 99%

“…The methods proposed in [37], [38], and [39], reach the lower bound of O(N log N ) time for all-to-all personalized communication on hypercubes, whereas the methods proposed in [40] and [41] reduce the log N factor in the time complexity thanks to the hierarchical organization of the network. In this work, we consider the Butterfly-Butterfly MIN, which has a O(log N ) diameter like hypercubes (2 log N − 1 to be precise), but can realize the all-toall personalized communication in optimal O(N ) time as communication can be pipelined.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based Networks

Izzi

Massini

2023

IEEE Access

View full text Add to dashboard Cite

The communication network is a key component in parallel and distributed systems, highperformance computing (HPC) systems and Data Centers, as information exchange has a key role in communication-intensive applications. The all-to-all personalized exchange is a relevant communication pattern and has been extensively studied for many network topologies. When considering a Multistage Interconnection Network (MIN) with log N stages, the realization of all-to-all communication is obtained through a sequence of admissible permutations forming a Latin square. If a particular Latin square is desired, double MINs consisting of 2 log N -1 stages are required. In this work, we consider the Butterfly-Butterfly network to realize the Latin square consisting of the identity permutation and its N − 1 rotations, RLS, and we show how to obtain the sequence of rotations forming such a Latin square, without storing it. We propose a method to realize the N permutations in pipeline fashion taking optimal O(N ) time, and we analyze the energy consumption according to the order of realization of the permutations, both on Butterfly-Butterfly network and on a single Butterfly used twice. We also show how to generate a Latin Square starting from any realizable permutation exploiting the switch configurations of the RLS.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based Networks

Izzi

Massini

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The need to develop parallel processing in computers has become highly essential, leading the advent of newer interconnection networks to enable parallel processing. Interconnection networks, abbreviated as (Ins), may be classified as either dynamic or static [2].…”

Section: Introductionmentioning

confidence: 99%

An Innovative Topologies Based on Hypercube Network Interconnection

Mohsin,

AL Rammahi,

Rabee

2023

COMPUTE

View full text Add to dashboard Cite

A parallel processing system's most crucial part is a network interconnection that links its processors. The hypercube topology has interesting features that make it a great option for parallel processing applications. This paper presents two innovative configurations of interconnection networks based on fractal Sierpinski and a hypercube. These are called the Sierpinski Triangle Topology (STT) and Sierpinski Carpet Topology (SCT). Compared to a hypercube, the Sierpinski Triangle topology (STT) noticed a significant decrease in the number of nodes and links as large networks grew. Hence, it is considered a great way to reduce costs because it uses fewer nodes and links. The average distance is also shorter, which is better. Despite it having a smaller bisection width and a higher degree than a hypercube by one. The Sierpinski Carpet Topology (SCT) has the advantage of having a high bisection width compared to a hypercube. That is preferable because it places a lower restriction on the difficulty of parallel algorithms. While the drawback of this topology is that it has a diameter and average distance more than a hypercube.

show abstract

“…The need to develop parallel processing in computers has become essential, leading to the advent of newer interconnection networks to enable parallel processing. Interconnection networks, abbreviated as (Ins), may be classified as either dynamic or static [2].Connections in a static network are permanent ties, but connections in a dynamic network may be built up on the fly according to the system's requirements. Point-to-point connections directly link a processor and other processors in static networks.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

A New Fractal Topologies Based on Hypercube Interconnection Network

Khudhair,

Rabee,

Al-Rammahi

2023

AJEST

View full text Add to dashboard Cite

A parallel processing system's most crucial part is a network interconnection that links its processors. The hypercube topology has exciting features, making it an excellent option for parallel processing applications. This paper presents two innovative configurations of interconnection networks based on fractal Sierpinski and a hypercube. These are the Sierpinski Triangle Topology (STT) and Sierpinski Carpet Topology (SCT). Compared to a hypercube, the Sierpinski Triangle topology (STT) noticed a significant decrease in the number of nodes and links as large networks grew. Hence, it considers a great way to reduce costs because it uses fewer nodes and links. The average distance is also shorter, which is better. Despite it has a smaller bisection width and a more degree than a hypercube by one. The Sierpinski Carpet Topology (SCT) has the advantage of having a higher bisection width than a hypercube. That is preferable because it places a lower restriction on the difficulty of parallel algorithms. In contrast, the drawback of this topology is that it has a diameter and average distance more than a hypercube.

show abstract

Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks

Cited by 7 publications

References 18 publications

Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based Networks

Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based Networks

An Innovative Topologies Based on Hypercube Network Interconnection

A New Fractal Topologies Based on Hypercube Interconnection Network

Contact Info

Product

Resources

About