On parallel integer sorting |
| |
Authors: | Sanguthevar Rajasekaran Sandeep Sen |
| |
Affiliation: | (1) Department of Computer and Information Science, University of Pennsylvania, 172 Moore Building, 19104 Philadelphia, PA, USA;(2) Department of Computer Science, Duke University, 27706 Durham, NC, USA |
| |
Abstract: | We present an optimal algorithm for sortingn integers in the range 1,n
c
] (for any constantc) for the EREW PRAM model where the word length isn
, for any >0. Using this algorithm, the best known upper bound for integer sorting on the (O(logn) word length) EREW PRAM model is improved. In addition, a novel parallel range reduction algorithm which results in a near optimal randomized integer sorting algorthm is presented. For the case when the keys are uniformly distributed integers in an arbitrary range, we give an algorithm whose expected running time is optimal.Supported by NSF-DCR-85-03251 and ONR contract N00014-87-K-0310 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|