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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
