Getting more from out-of-core columnsort

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2409, Issue , 2002, Pages 143-154

  Chaudhry, Geeta ^a   Cormen, Thomas H ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

ASYNCHRONOUS I/O; DISK I/O; ENGINEERING TECHNIQUES; EXPERIMENTAL EVIDENCE; OUT-OF-CORE; PERFORMANCE GAIN; RELATIVE SPEED; RUNNING TIME;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

EID: 84929090353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_11     Document Type: Conference Paper

References (6)

1. Chaudhry, G., Cormen, T.H., Wisniewski, L.F.: Columnsort lives! An efficient out-of-core sorting program. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures. (2001) 169-178
2. Leighton, T.: Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers C-34 (1985) 344-354
3. Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H., Culler, D.E., Hellerstein, J.M., Patterson, D.A.: High-performance sorting on networks of workstations. In: SIGMOD '97. (1997)
4. Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI—The Complete Reference, Volume 1, The MPI Core. The MIT Press (1998)
5. Gropp, W., Huss-Lederman, S., Lumsdaine, A., Lusk, E., Nitzberg, B., Saphir, W., Snir, M.: MPI—The Complete Reference, Volume 2, The MPI Extensions. The MIT Press (1998)
6. Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. (1986) 255-263