A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show that n integers in the range 1, ..., n can be sorted stably on an EREW PRAM using O(t) time and O(n(-log n log log n+(log n) 2 Ât)) operations, for arbitrary given t log n log log n, and on a CREW PRAM using O(t) time and O(n(-log n+log nÂ2 tÂlog n )) operations, for arbitrary given t log n. In addition, we are able to sort n arbitrary integers on a randomized CREW PRAM within the same resource bounds with high probability. In each case our algorithm is a factor of almost 3(-log n)doi:10.1006/inco.1997.2632 fatcat:lfxceubgffazhdbhgthfd5rxim