An improved reliability bound of a probabilistic parallel integer sorting algorithm

Authors:
Alexandros V. Gerbessiotis
Affiliations:
CS Department, New Jersey Institute of Technology, Newark, NJ 07102, USA
Venue:
Information Processing Letters
Year:
2012

Citing 5
Cited 0

Parallel merge sort

SIAM Journal on Computing
Hybridsort revisited and parallelized

Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
On parallel integer sorting

Acta Informatica
Probabilistic integer sorting

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

It is shown how one can improve the reliability bound of the parallel sorting algorithm of Rajasekaran and Sen (1992) [7] that sorts uniformly distributed integer keys on a CRCW Parallel Random Access Machine (PRAM). The probability of success improves to 1-2^-^@W^(^n^l^o^g^l^o^g^n^/^l^o^g^n^) from the previous bound of 1-2^-^@W^(^n^/^(^l^o^g^n^l^o^g^l^o^g^n^)^) while retaining the O@?(logn) time bound for sorting n uniformly distributed integers on n/logn processors.