๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comments on broadcast algorithms for two-dimensional grids

โœ Scribed by Martin Simmen

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
202 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

โœฆ Synopsis

Slmmen, M_, Comments on broadcast algorithms for two-dimensional grids, Parallel Computing 17 (1991) 109-112.

In a recent paper, Saad and Schultz discussed several algorithms for broadcasting data in loosely coupled two-dimensional processor grids. This note disputes a claim made about the performance of one of their algorithms. An alternative algorithm is proposed.

๐Ÿ“œ SIMILAR VOLUMES

A two-dimensional monotonical logical gr
A two-dimensional monotonical logical grid algorithm
โœ Sieghard Weinketz ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 434 KB

This paper describes a two-dimensional implementation of a monotonical logical grid (MLG) algorithm for a Monte Carlo study of a two-dimensional Lennard-Jones fluid, and compares its performance with a conventional link-cell algorithm with the same purpose. It is obtained that the MLG scales approxi

On broadcasting multiple messages in a d
On broadcasting multiple messages in a d-dimensional grid
โœ Y. Roditty; B. Shoham ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 451 KB

An algorithm for broadcasting multiple messages on a d-dimensional grid (d > 3 ) starting from the (1, 1, , 1) comer is presented. The algorithm has a complexity of d(n + m -2), where m is the number of messages transmitted and n is the number of points in each dimension. This answers a conjecture t

A poly-algorithm for parallel dense matr
A poly-algorithm for parallel dense matrix multiplication on two-dimensional process grid topologies
โœ Li, J.; Skjellum, A.; Falgout, R. D. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 872 KB

In this paper, we present several new and generalized parallel dense matrix multiplication algorithms of the form C = ฮฑAB + ฮฒC on two-dimensional process grid topologies. These algorithms can deal with rectangular matrices distributed on rectangular grids. We classify these algorithms coherently int

Two-tree algorithms for full bandwidth b
Two-tree algorithms for full bandwidth broadcast, reduction and scan
โœ Peter Sanders; Jochen Speck; Jesper Larsson Trรคff ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 673 KB

We present a new, simple algorithmic idea for the collective communication operations broadcast, reduction, and scan (prefix sums). The algorithms concurrently communicate over two binary trees which both span the entire network. By careful layout and communication scheduling, each tree communicates