AlphaSort

Nyberg, Chris; Barclay, Thomas; Cvetanovic, Zarka; Gray, Jim; Lomet, Dave

doi:10.1145/191843.191884

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2002

2015

Publication Types

Select...

Article4

Book1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 14 publications

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

STXXL: standard template library for XXL data sets

Dementiev¹,

Kettner

Sanders³

2007

Softw Pract Exp

102

View full text Add to dashboard Cite

We present a software library Stxxl, that enables practice-oriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library STL for external memory computations. It supports parallel disks, overlapping between I/O and computation and is the first external memory algorithm library that supports the pipelining technique that can save more than half of the I/Os. Stxxl has already been used for the following applications: implementations of external memory algorithms for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing suffix arrays, and computing social network analysis metrics for huge graphs.

show abstract

STXXL: standard template library for XXL data sets

Dementiev¹,

Kettner

Sanders³

2007

Softw Pract Exp

102

View full text Add to dashboard Cite

show abstract

Symmetry Partition Sort

Chen

2007

Softw Pract Exp

View full text Add to dashboard Cite

In this paper, we propose a useful replacement for quicksort‐style utility functions. The replacement is called Symmetry Partition Sort, the principle of which is similar to that of Proportion Extend Sort. The main characteristic of the new algorithm is that it always places partially sorted inputs (used as a basis for proportional extensions) at each end of an array when entering the partitioning routine. This is advantageous in speeding up the processing for partitioning. The library function we developed based on the new algorithm is more attractive than the Psort library function introduced in 2004 because of its simple implementation mechanism, clearer source code, and faster operation with a performance guarantee of O(n log n). Increased robustness and adaptivity also make it highly competitive as a library function. Copyright © 2007 John Wiley & Sons, Ltd.

show abstract