A randomized parallel sorting algorithm with an experimental study
type: Item
instance of: scholarly article
title: A randomized parallel sorting algorithm with an experimental study
zbMATH Open document ID: 0909.68045
author: David R. Helman
author: David A. Bader
author: Joseph Ja'Ja'
published in: Journal of Parallel and Distributed Computing
publication date: 1999-03-30T00:00:00Z
full work available at URL: http://hdl.handle.net/1903/835
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1216773
zbMATH Keywords: load balancing
MaRDI profile type: Publication
OpenAlex ID: W2060999145
DOI: 10.1006/JPDC.1998.1462
Recommended article: An experimental analysis of parallel sorting algorithms
Recommended article: Power balance and apportionment algorithms for the United States Congress
Recommended article: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Recommended article: An efficient parallel sorting algorithm for shared memory multiprocessors
Recommended article: An efficient parallel sorting algorithm
Recommended article: On the versatility of parallel sorting by regular sampling
Recommended article: A benchmark parallel sort for shared memory multiprocessors
Recommended article: Parallel sorting revisited
Recommended article: Q3805925
Recommended article: An optimal parallel adaptive sorting algorithm
description: scientific article; zbMATH DE number 1216773