Asynchronous parallel disk sorting

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 138-148

  Dementiev, Roman ^a   Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithm engineering; Algorithm library; External memory sorting; Large data sets; Overlapping I O and computation; Parallel disks; Prefetching; Randomized algorithm; Secondary memory

Indexed keywords

BANDWIDTH; COMPUTATION THEORY; DATA STORAGE EQUIPMENT;

PARALLEL DISK SORTING;

SORTING;

EID: 0038379313     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777435     Document Type: Conference Paper

References (30)

1. R. C. Agarwal. A super scalar sort algorithm for RISC processors. In SIGMOD, pages 240-247. ACM, 1996.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
3. S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 454-462, New York, May 23-26 1998. ACM Press.
4. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing i/o-efficient data structures using TPIE. In 10th European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 88-100. Springer, 2002.
5. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601-631, 1997.
6. R. D. Barve and J. S. Vitter. A simple and efficient parallel disk merge sort. In 11th ACM Symposium on Parallel Algorithms and Architectures, pages 232-241, 1999.
7. P. Cao, E. W. Felten, A. R. Karlin, and K. Li. Implementation and performance of integrated application-controlled file caching, prefetching and disk scheduling. ACM Transactions on Computer Systems, 14(4):311-343, Nov. 1996.
8. G. Chaudhry and T. H. Cormen. Getting more from out-of-core columnsort. In 4th Workshop on Algorithm Engineering and Experiments (ALENEX), number 2409 in LNCS, pages 143-154, 2002.
9. G. Chaudhry, T. H. Cormen, and L. F. Wisniewski. Columnsort lives! an efficient out-of-core sorting program. In 13th ACM Symposium on Parallel Algorithms and Architectures, pages 169-178, 2001.
10. A. Crauser and K. Mehlhorn. LEDA-SM a platform for secondary memory computations. Technical report, MPII, 2000. draft.
11. R. Dementiev and P. Sanders. Asynchronous parallel disk sorting. Technical Report MPI-I-2003-1-001, MPI Informatik, Germany, 2003.
12. D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing with parallel disks. In 9th European Symposium on Algorithms (ESA), number 2161 in LNCS, pages 62-73. Springer, 2001.
13. M. Kallahalla and P. Varman. Optimal prefetching and caching for parallel I/O systems. In ACM Symposium on Parallel Architectures and Algorithms, pages 219-228, 2001.
14. T. Kimbrel and A. R. Karlin. Near-optimal parallel prefetching and caching. SIAM Journal on Computing, 29(4): 1051-1082, 2000.
15. D. E. Knuth. The Art of Computer Programming -Sorting and Searching, volume 3. Addison Wesley, 2nd edition, 1998.
16. P. Larson and G. Graefe. Memory management during run generation in external memory. In SIGMOD, pages 472-484. ACM, 1998.
17. M. H. Nodine and J. S. Vitter. Deterministic distribution sort in shared and distributed memory multiprocessors. In 5th ACM Symposium on Parallel Algorithms and Architectures, pages 120-129, Velen, Germany, 1993.
18. M. H. Nodine and J. S. Vitter. Greed sort: An optimal sorting algorithm for multiple disks. Journal of the ACM, 42(4):919-933, 1995.
19. C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet. AlphaSort: A RISC machine sort. In SIGMOD, pages 233-242, 1994.
20. C. Nyberg, C. Koester, and J. Gray. Nsort: A parallel sorting program for NUMA and SMP machines, 2000. http://www.ordinal.com/lit.html.
21. V. S. Pai and P. J. Varman. Prefetching with multiple disks for external mergesort: Simulation and analysis. In ICDE, pages 273-282, 1992.
22. S. Rajasekaran. A framework for simple sorting algorithms on parallel disk systems. In 10th ACM Symposium on Parallel Algorithms and Architectures, pages 88-98, 1998.
23. P. Sanders. Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics, 5, 2000.
24. P. Sanders, S. Egner, and J. Korst. Fast concurrent access to parallel disks. In 11th ACM-SIAM Symposium on Discrete Algorithms, pages 849-858, 2000.
25. J. van den Bercken, B. B. J.-P. Dittrich, J. Krämer, T. Schäfer, M. Schneider, and B. Seeger. XXL - a library approach to supporting efficient implementations of advanced database queries. In 27th International Conference on Very Large Data Bases, pages 39-48. Morgan Kaufmann, 2001.
26. J. van den Bercken, J.-P. Dittrich, and B. Seeger. java.XXL: A prototype for a library of query processing algorithms. In International Conference on Management of Data, volume 29(2), page 588. ACM, 2000.
27. D. E. Vengroff. TPIE User Manual and Reference. Duke University, 1995. http: //www.CB.duke.edu/̃dev/tpie_home_page.html.
28. J. S. Vitter and D. A. Hutchinson. Distribution sort with randomized cycling. In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 77-86, 2001.
29. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory, I: Two level memories. Algorithmica, 12(2/3):110-147, 1994.
30. J. Wyllie. SPsort: How to sort a terabyte quickly. http://research.microsoft.com/barc/SortBenchmark/SPsort.pdf, 1999.