312 search results - page 1 / 63 » A Cost Optimal Parallel Algorithm for Patience Sorting |
PPL
2006
13 years 5 months ago
2006
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
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...