2003 Penny sort

Sorting 39GB for a Penny

I sorted 39GB for a penny using a cheap general purpose processor and two disk drives, running each drive at about 28MB/s sustained. No special-purpose processors, such as GPUs, were employed for the in-memory part of the sort. The sort is a general-purpose sort that can compare records of arbitrary size, and does not rely on the keys being uniformly randomly distributed.

OzSort 2.0: Sorting up to 252GB for a Penny

We present OzSort 2.0, a stable external merge sort software optimized for the requirements of PennySort Indy 2010. OzSort 2.0 is engineered to better exploit multi-core processors over its predecessor, and to further minimize cache misses. In this paper, we explain the workings of OzSort 2.0 and show how we sorted up to 252GB (2 516 582 400 records) for a Penny (< 1929s) using standard desktop...

Performance / Price Sort

NTsort is an external sort on WindowsNT 5.0. It has minimal functionality but excellent price performance. In particular, running on mail-order hardware it can sort 1.5 GB for a penny. NT5.0 is not yet available. For commercially available sorts, Postman Sort from Robert Ramey Software Development has elapsed time performance comparable to NTsort, while using less processor time. It can sort 1....

Hierarchical Models

Traces: Embodied Immersive Interaction with Semi-Autonomous Avatars

Traces is an artwork for the CAVE that uses a novel machine vision system to enable unencumbered full body interaction with a range of semi-autonomous agents without the imposition of any sort of textual, iconic or encoded-gestural interfaces and without