๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Communication primitives for BSP computers

โœ Scribed by Ben H.H. Juurlink; Harry A.G. Wijshoff

Book ID
103106755
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
706 KB
Volume
58
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Communication Efficient BSP Algorithm fo
Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem
โœ Xin He; Chun-Hsi Huang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

We present a BSP (Bulk Synchronous Parallel) algorithm for solving the All Nearest Smaller Values Problem (ANSVP), a fundamental problem in both graph theory and computational geometry. Our algorithm achieves optimal sequential computation time and uses only three communication supersteps. In the wo

Portability, predictability and performa
Portability, predictability and performance for parallel computing: BSP in practice
โœ Reed, Joy; Parrott, Kevin; Lanfear, Tim ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 783 KB

We report on practical experience using the Oxford BSP Library to parallelize a large electromagnetic code, the British Aerospace finite-difference time-domain code EMMA TFD3D. The Oxford BSP Library is one of the first realizations of the Bulk Synchronous Parallel computational model to be targeted