Relaxing the problem-size bound for out-of-core columnsort

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 250-251

  Chaudhry, Geeta ^a   Hamon, Elizabeth A ^a   Cormen, Thomas H ^a  

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

Author keywords

Cluster; Columnsort; Out of core; Parallel sorting

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTATION THEORY; DATA STORAGE EQUIPMENT; SORTING;

COLUMN SORTING;

PARALLEL PROCESSING SYSTEMS;

EID: 0037703315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777455     Document Type: Conference Paper

References (5)

1. G. Chaudhry and T. H. Cormen. Getting more from out-of-core columnsort. In 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02), pages 143-154, Jan. 2002.
2. G. Chaudhry and T. H. Cormen. Stupid columnsort tricks. Technical Report TR2003-444, Dartmouth College Department of Computer Science, Apr. 2003.
3. G. Chaudhry, T. H. Cormen, and L. F. Wisniewski. Columnsort lives! An efficient out-of-core sorting program. In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 169-178, July 2001.
4. G. Chaudhry, E. A. Hamon, and T. H. Cormen. Relaxing the problem-size bound for out-of-core columnsort. Technical Report TR2003-445, Dartmouth College Department of Computer Science, Apr. 2003.
5. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput., C-34(4):344-354, Apr. 1985.