✦ LIBER ✦

On broadcasting multiple messages in a d-dimensional grid

✍ Scribed by Y. Roditty; B. Shoham

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 451 KB
Volume: 75
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)89163-9

No coin nor oath required. For personal study only.

✦ Synopsis

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 that appears in Van Scoy and Brookes (1994), namely, that the time required for broadcasting m messages over this d-dimensional grid is dn + ((d' + 1 )/d)m + k, k being a constant.

Then, we discuss the case where the starting point (for transmitting the message) is arbitrary.

📜 SIMILAR VOLUMES

Broadcasting multiple messages in a grid

✍ Frances L. Van Scoy; Jeffrey A. Brooks 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Broadcasting in m-dimensional grid graph

Broadcasting in m-dimensional grid graphs with a given neighborhood template

✍ Selma Djelloul 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 792 KB

A multiple grid algorithm for one-dimens

A multiple grid algorithm for one-dimensional transient open channel flows

✍ Scott A. Yost; Prasada Rao 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Numerical modeling of open channel ¯ows with shocks using explicit ®nite dierence schemes is constrained by the choice of time step, which is limited by the CFL stability criteria. To overcome this limitation, in this work we introduce the application of a multiple grid algorithm to the ®eld of comp

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

Using the grid spacing ratio as a contin

Using the grid spacing ratio as a continuous variable in one dimensional adaptive grid generation

✍ Prabir Daripa 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Parameter optimization in 3D reconstruct

Parameter optimization in 3D reconstruction on a large scale grid

✍ J.R. Bilbao-Castro; A. Merino; I. García; J.M. Carazo; J.J. Fernández 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Reaching as high structural resolution as possible in 3D electron microscopy of biological specimens is crucial to understanding their function and interactions. Technical and biological limitations make electron microscopy projections of such specimens quite noisy. Under those circumstances, the br