✦ LIBER ✦

Parallel algorithms for gossiping by mail

✍ Scribed by A. Bagchi; S.L. Hakimi; J. Mitchem; E. Schmeichel

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 535 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90160-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Broadcastin

Approximation Algorithms for Broadcasting and Gossiping

✍ Pierre Fraigniaud; Sandrine Vial 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Broadcasting and gossiping are two basic communication patterns which commonly occur when programming parallel and distributed systems. This paper deals with approximation algorithms for solving these problems on arbitrary topologies. We present new strategies to derive efficient broadcasting and go

A randomized algorithm for gossiping in

A randomized algorithm for gossiping in radio networks

✍ Marek Chrobak; Leszek Ga̧sieniec; Wojciech Rytter 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

## Abstract We present an __O__(__n__ log^4^__n__)‐time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (determ

Parallel algorithms for corner stitching

✍ Mehta, Dinesh P.; Wilson, Erica D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor. In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithm

Parallel Algorithms for Orthotropic Prob

Parallel Algorithms for Orthotropic Problems

✍ Ivar Gustafsson; Gunhild Lindskog 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation

Parallel algorithms for panel methods

✍ Tim David; Graham Blyth 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 894 KB

Parallel algorithms for semi-lagrangian

Parallel algorithms for semi-lagrangian advection

✍ A. V. Malevsky; S. J. Thomas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 2 views

Numerical time step limitations associated with the explicit treatment of advection-dominated problems in computational ¯uid dynamics are often relaxed by employing Eulerian±Lagrangian methods. These are also known as semi-Lagrangian methods in the atmospheric sciences. Such methods involve backward