𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coarse-Grained Parallel Geometric Search

✍ Scribed by Albert Chan; Frank Dehne; Andrew Rau-Chaplin

Book ID
102599624
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
180 KB
Volume
57
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Deterministic parallel selection algorit
Deterministic parallel selection algorithms on coarse-grained multicomputers
✍ M. Cafaro; Vincenzo De Bene; G. Aloisio πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 351 KB

## Abstract We present two deterministic parallel Selection algorithms for distributed memory machines, under the coarse‐grained multicomputer model. Both are based on the use of two weighted 3‐medians, that allows discarding at least 1/3 of the elements in each iteration. The first algorithm sligh

C3: A Parallel Model for Coarse-Grained
C3: A Parallel Model for Coarse-Grained Machines
✍ Susanne E. Hambrusch; Ashfaq A. Khokhar πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 608 KB

In this paper, we propose a model for parallel computation, the C 3 -model. The C 3 -model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising during communication. A metric for estimatin