Sciweavers

78 search results - page 5 / 16
» Optimizing Parallel Bitonic Sort
Sort
View
PPL
2006
134views more  PPL 2006»
13 years 7 months ago
A Cost Optimal Parallel Algorithm for Patience Sorting
Takaaki Nakashima, Akihiro Fujiwara
IPL
1998
46views more  IPL 1998»
13 years 7 months ago
An Optimal Parallel Algorithm for Sorting Multisets
Sanguthevar Rajasekaran
ICPP
1995
IEEE
13 years 11 months ago
Sorting and Selection on Distributed Memory Bus Computers
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...
Sanguthevar Rajasekaran, Sartaj Sahni
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 29 days ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
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 ...
Sanguthevar Rajasekaran, Sandeep Sen
IPPS
1997
IEEE
13 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
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...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu