Complete exchange and broadcast algorithms for meshes

Takkella, S.; Seidel, S.

doi:10.1109/shpcc.1994.296674

Cited by 5 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to apply CALMANT, we have designed a CC-cube algorithm for the Complete Exchange problem that is described in the next section. The resulting algorithm has been compared with a wide range of proposals specially tuned for the solution of the Complete Exchange: Binary [1], Quadrant [1], Modified Quadrant [14], Store-and-Forward (SAF) [14], Direct [11], Cyclic [12], and Hybrid [13] methods. Some of these proposals are addressed to 2-dimensional meshes and some others to c-dimensional meshes.…”

Section: An Example: the Complete Exchange Problemmentioning

confidence: 99%

Hypercube algorithms on mesh connected multicomputers

Cerio

Valero-García

González

2002

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are many important algorithms that fit into the CC-cube type. CALMANT is based on three different techniques: a) the standard embedding to assign the processes of the algorithm to the nodes of the mesh multicomputer; b) the communication pipelining technique to increase the level of communication parallelism inherent in the CC-cube algorithms; and c) optimal message-scheduling algorithms proposed in this work in order to avoid conflicts and minimizing in this way the communication time. Although CALMANT is proposed for multicomputers with different interconnection network topologies, this paper only focuses on the particular case of meshes.

show abstract

Section: An Example: the Complete Exchange Problemmentioning

confidence: 99%

Hypercube algorithms on mesh connected multicomputers

Cerio

Valero-García

González

2002

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…We have restricted ourselves to algorithms designed for onedimensional processor meshes. In cases where nonsquare logical meshes were mapped to approximately square physical grids, it would be possible in principle to utilize specialized algorithms that exploit the extra connectivity [2,30]. Because our experiments show that "optimal" processor grids are mostly close to square, we believe that these algorithms would not change our results.…”

Section: Decomposingmentioning

confidence: 99%

Parallel Algorithms for the Spectral Transform Method

Foster¹,

Worley²

1997

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

The spectral transform method is a standard numerical technique for solving partial differentiM equations on a sphere and is widely used in atmospheric circulation models. Recent research has identified several promising algorithms for implementing this method on massively parallel computers; however, no detailed comparison of the different algorithms has previously been attempted. In this paper, we describe these different parallel algorithms and report on computational experiments that we have conducted to evaluate their efficiency on parallel computers. The experiments used a testbed code that solves the nonLinear shallow water equations on a sphere; considerable care was taken to ensure that the experiments provide a [air comparison of the different algorithms and that the " results are relevant to global models. We focus on hypercube-and mesh-connected multicomputers with cut-through routing, such as the Intel iPSC/860, DELTA, and Paragon, and the nCUBE/2, but also indicate how the results extend to other parallel computer architectures. The results of this study are relevant not only to the spectral transform method but also to multidimensional FFTs and other parallel transforms.

show abstract

“…It can also be used to evaluate the quality of an interconnection network. Pervious work for complete exchange can be found in [1,3,6,8,9,10] for meshes, and [2,4,7,11,12] for tori.…”

Section: Introductionmentioning

confidence: 99%

Toward optimal complete exchange on wormhole-routed tori

Tseng

Sheu

1999

IEEE Trans. Comput.

View full text Add to dashboard Cite

In this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. In the literature, some algorithms are optimal in only one of startup and transmission costs, while some, although are asymptotically optimal in both costs, will incur much larger constants associated with the costs. Our algorithms use both asymptotically optimal startup and transmission time on tori of equal size along each dimension. The schemes are characterized by: (i) the use of gather-scatter tree to achieve optimality in startup time, (ii) the enforcement of shortest paths in routing messages to achieve optimality in transmission time, (iii) the application of network-partitioning techniques to reduce the constant associated with the transmission time, and (iv) the dimension-by-dimension and gather-scatter-tree approach to make possible applying the schemes to non-square, any-size tori. Numerical analysis and experiment both show significant improvement on total communication latency over existing results.

show abstract

Complete exchange and broadcast algorithms for meshes

Cited by 5 publications

References 7 publications

Hypercube algorithms on mesh connected multicomputers

Hypercube algorithms on mesh connected multicomputers

Parallel Algorithms for the Spectral Transform Method

Toward optimal complete exchange on wormhole-routed tori

Contact Info

Product

Resources

About