𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bulk Synchronous Parallel Algorithms for the External Memory Model

✍ Scribed by Dehne; Dittrich; Hutchinson; Maheshwari

Publisher
Springer
Year
2002
Tongue
English
Weight
210 KB
Volume
35
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bulk synchronous parallel: practical exp
Bulk synchronous parallel: practical experience with a model for parallel computing
✍ Danny Krizanc; Anton Saarimaki πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 339 KB

Valiant proposed the Bulk Synchronous Parallel (BSP) model as a possible model for parallel computing. He refers to BSP as a ``bridging'' model, being applicable to both system and algorithm design. The model allows hardware and software design to proceed independently but ensures compatibility betw

Parallel β€˜go with the winners’ algorithm
Parallel β€˜go with the winners’ algorithms in distributed memory models
✍ Marcus Peinado; Thomas Lengauer πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 290 KB

We parallelize the 'go with the winners' algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492-501) and analyze the resulting parallel algorithm in the LogP-model (in: Procee

Performance Analysis of the Parallel Kar
Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures
✍ GIOVANNI CESARI; ROMAN MAEDER πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 447 KB

We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre

Parallel algorithms for downdating the l
Parallel algorithms for downdating the least squares estimator of the regression model
✍ Petko I. Yanev; Erricos J. Kontoghiorghes πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 993 KB

Computationally efficient parallel algorithms for downdating the least squares estimator of the ordinary linear regression are proposed. The algorithms, which are based on the QR decomposition, are block versions of sequential Givens strategies and efficiently exploit the triangular structure of the