S. Rajasekaran and J. H. Reif. Optimal and sublogrithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594--607, June 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Sorting is an important symbolic application [4] and parallel algorithms for sorting have been studied intensively ever since Batcher [5] proposed the bitonic sorting network. Although the theoretical community has devoted considerable effort to the design of parallel sorting algorithms [2, 3, 18, 27, 10, 26, 16, 23], empirical studies [12, 11, 7, 34, 25, 29, 35] started appearing only in the late 1980 s when multiprocessors became widely available. In a typical parallel sorting algorithm, each processor contains a portion of the list of n elements to be sorted. In a merge based approach, each processor sorts ....

S. Rajasekaran and J. H. Reif. Optimal and sublogrithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594--607, June 1989.

....compared with two other well known practical parallel sorting algorithms based on radix sort and sample sort. The experimental results show that the distributed radix sort is competitive with the other two algorithms. 1 Introduction Sorting has been a widely studied problem for parallel machines [8, 9, 12, 14, 13, 10, 1, 4, 7, 6, 11]. Integer sorting is a subclass of the sorting problem where the elements have integer values such that the value of the maximum element is polynomially bounded in the number of elements to be sorted. The work requirements of integer sorting is O(n) where n is the number of elements, and the ....

S. Rajasekaran and J. H. Reif. Optimal and sublogrithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594--607, June 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC