Sciweavers

21 search results - page 1 / 5
» Linear Time Sorting of Skewed Distributions
Sort
View
SPIRE
1999
Springer
13 years 10 months ago
Linear Time Sorting of Skewed Distributions
This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows th...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
IPPS
2000
IEEE
13 years 10 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
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...
Jie Wu
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
13 years 11 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
IPPS
2006
IEEE
13 years 11 months ago
GPU-ABiSort: optimal parallel sorting on stream architectures
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
Alexander Greß, Gabriel Zachmann
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 7 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...