57 search results - page 3 / 12 » An Optimal Parallel Algorithm for Sorting Multisets |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
ISAAC
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
ICPP
1995
IEEE
13 years 11 months ago
1995
IEEE
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...