Parallel Sorting on the NEC Cenju-3 and IBM SP2

Authors:
Darren Sanders;Yoonho Park;Vasudha Govindan
Affiliations:
-;-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 3
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast Parallel Sorting Under LogP: Experience with the CM-5

IEEE Transactions on Parallel and Distributed Systems
A Taxonomy of Parallel Sorting

A Taxonomy of Parallel Sorting

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe two well known parallel sorting algorithms, the bitonic mergesort and the samplesort and analyze performance implications of different implementation strategies. Then we present performance measurements from two similar parallel computers, the NEC Cenju-3 and the IBM SP2, and provide an analysis of the behavior of the two algorithms and the two parallel computers from our results.