An experimental study of BSP sorting algorithms

A. V. Gerbessiotis, C. J. Siniolakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

The Bulk-Synchronous Parallel (BSP) model of computation has been proposed as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. In this work we implement, using the Oxford BSP Toolset, BSPlib, a number of BSP deterministic and randomized sorting algorithms on a variety of parallel systems, including the SGI Power Challenge and the CRA Y T3D. Our experimental results illustrate the efficiency, portability and reusability of our algorithms across such diverse hardware platforms, and reinforce our claim that the BSP model can be used as a kind of programming paradigm.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages479-485
Number of pages7
ISBN (Electronic)0818683325, 9780818683329
DOIs
StatePublished - 1998
Externally publishedYes
Event6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998 - Madrid, Spain
Duration: Jan 21 1998Jan 23 1998

Publication series

NameProceedings of the 6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998

Conference

Conference6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998
Country/TerritorySpain
CityMadrid
Period1/21/981/23/98

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'An experimental study of BSP sorting algorithms'. Together they form a unique fingerprint.

Cite this