The performance of a selection of sorting algorithms on a general purpose parallel computer
R.D. Dowsing, Wellington S. Martins · Concurrency Practice and Experience · 1998
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. © 1998 John Wiley & Sons, Ltd.