𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The performance of a selection of sorting algorithms on a general purpose parallel computer

✍ Scribed by DOWSING, R. D.; MARTINS, W. S.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
289 KB
Volume
10
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel machine and permitting the design and analysis of algorithms whose performance can be predicted for real machines. In this paper we analyse the performance of three sorting algorithms on a BSP-type architecture and show qualitative agreement between experimental results from a simulator and theoretical performance equations.

πŸ“œ SIMILAR VOLUMES

A comparative study of pressure correcti
A comparative study of pressure correction and block-implicit finite volume algorithms on parallel computers
✍ M. Kurreck; S. Wittig πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 364 KB

A comparison of a new parallel block-implicit method and the parallel pressure correction procedure for the solution of the incompressible Navier-Stokes equations is presented. The block-implicit algorithm is based on a pressure equation. The system of non-linear equations is solved by Newton's meth

Development of a parallel molecular dyna
Development of a parallel molecular dynamics code on SIMD computers: Algorithm for use of pair list criterion
✍ Roccatano, D.; Bizzarri, R.; Chillemi, G.; Sanna, N.; Di Nola, A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

In recent years several implementations of molecular dynamics Ε½ . Ε½ . MD codes have been reported on multiple instruction multiple data MIMD machines. However, very few implementations of MD codes on single instruction Ε½ . multiple data SIMD machines have been reported. The difficulty in using pair

An efficient implementation of the finit
An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 2 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges