An improved reliability bound of a probabilistic parallel integer sorting algorithm

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−Ω(nloglogn/logn) from the previous bound of 1−2−Ω(n/(lognloglogn)) while retaining the O˜(logn) time bound for sorting n uniformly distributed integers on n/logn processors.