An improved reliability bound of a probabilistic parallel integer sorting algorithm
Document Type
Article
Publication Date
12-31-2012
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 Õ(logn) time bound for sorting n uniformly distributed integers on n/logn processors. © 2012 Elsevier B.V. All rights reserved.
Identifier
84866562762 (Scopus)
Publication Title
Information Processing Letters
External Full Text Location
https://doi.org/10.1016/j.ipl.2012.09.003
ISSN
00200190
First Page
976
Last Page
979
Issue
24
Volume
112
Grant
IIS-0324816
Fund Ref
National Science Foundation
Recommended Citation
Gerbessiotis, Alexandros V., "An improved reliability bound of a probabilistic parallel integer sorting algorithm" (2012). Faculty Publications. 17858.
https://digitalcommons.njit.edu/fac_pubs/17858
