Columnsort lives! An efficient out-of-core sorting program

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 169-178

  Chaudhry, G ^a   Cormen, T H ^a   Wisniewski, L F ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER WORKSTATIONS; INPUT OUTPUT PROGRAMS; PARALLEL ALGORITHMS; SORTING;

SORTING ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0034830167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378627     Document Type: Conference Paper

References (11)

1. The input/output complexity of sorting and related problems
2. High-performance sorting on networks of workstations
3. A simple and efficient parallel disk mergesort
4. Cormen and Melissa Hirschl. Early experiences in evaluating the Parallel Disk Model with the ViC* implementation
5. Tight bounds on the complexity of parallel sorting
6. Greed sort: Optimal deterministic sorting on parallel disks
7. A framework for simple sorting algorithms on parallel disk systems
8. An optimal sorting algorithm for mesh connected computers