Sciweavers

Share
ISCAPDCS
2004

Randomized Sorting on the POPS Network

9 years 8 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamental problems on this architecture. The algorithms presented in this paper are valid for POPS(d, g) where d > g and use randomization. We present an algorithm that solves the problem of sparse enumeration sorting of d keys in O(d g +log g) time and hence performs better than previous algorithms. We also present algorithms that allow us to do stable sorting of integers in the range [1, log n] and [1, d g ] in O( d g + log n) time. When g = n , for any constant 0 < < 1 2 this allows us to do sorting of integers in the range [1, n] in O( 1 1-2 ( d g + log g)) time. We finally use these algorithms to solve the problem of multiple binary search in the case where we have d keys in O(d g + log g) time and in the case where we have integer keys in the range [1, n] in O( 1 1-2 ( d g + log g)) time, when g = n ...
Jaime Davila, Sanguthevar Rajasekaran
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where ISCAPDCS
Authors Jaime Davila, Sanguthevar Rajasekaran
Comments (0)
books