𝔖 Bobbio Scriptorium
✦   LIBER   ✦

In search of numerical consistency in parallel programming

✍ Scribed by Robert W. Robey; Jonathan M. Robey; Rob Aulwes


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
1013 KB
Volume
37
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis


We present methods that can dramatically improve numerical consistency for parallel calculations across varying numbers of processors. By calculating global sums with enhanced precision techniques based on Kahan or Knuth summations, the consistency of the numerical results can be greatly improved with minimal memory and computational cost. This study assesses the value of the enhanced numerical consistency in the context of general finite difference or finite volume calculations.


πŸ“œ SIMILAR VOLUMES


Parallelism in alpha-beta search
✍ Raphael A. Finkel; John P. Fishburn πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 782 KB

We present a distributed algorithm for implementing a-~ search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed opera

Parallel searching in the plane
✍ Ricardo Baeza-Yates; RenΓ© Schott πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 479 KB