A framework for simple sorting algorithms on parallel disk systems

Theory of Computing Systems

Volumn 34, Issue 2, 2001, Pages 101-114

  Rajasekaran, S ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; GENERAL SORTING; ITS APPLICATIONS; PARALLEL DISK SYSTEMS; PARALLEL SORTING; PARALLEL SORTING ALGORITHMS; SORTING ALGORITHM; SPARSE ENUMERATION SORT;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

ALGORITHMS;

EID: 0035590716     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010020     Document Type: Article

References (25)

1. A. Aggarwal and C. G. Plaxton, Optimal Parallel Sorting in Multi-Level Storage, Proc. Fifth Annual ACM Symposium on Discrete Algorithms, 1994, pp. 659-668.
2. A. Aggarwal and J. S. Vitter, The Input/Output Complexity of Sorting and Related Problems, Communications of the ACM 31(9) (1988), 1116-1127.
3. M. Ajtai, J. Komlós, and E. Szemerédi, An O(n log n) Sorting Network, Proc. 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 1-9.
4. L. Arge, The Buffer Tree: A New Technique for Optimal I/O-Algorithms, Proc. 4th International Workshop on Algorithms and Data Structures (WADS), 1995, pp. 334-345.
5. R. Barve, E. F. Grove, and J. S. Vitter, Simple Randomized Mergesort on Parallel Disks, Parallel Computing 23(4-5) (1997), 601-631.
6. K. Batcher, Sorting Networks and Their Applications, Proc. AFIPS Spring Joint Computing Conference, 1968, pp. 307-314.
7. R. Cole, Parallel Merge Sort, SIAM Journal on Computing 17(4) (1988), 770-785.
8. T. E. Cormen and M. Hirschl, Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation, Parallel Computing 23 (1997), 571-600.
9. R. E. Cypher and C. G. Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers, Proc. ACM Symposium on Theory of Computing, 1990, pp. 193-203.
10. M. Dowd, Y. Perl, L. Rudolph, and M. Saks, The Periodic Balanced Sorting Network Journal of the ACM 36 (1989), 738-757.
11. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, Freeman, San Francisco, CA, 1998.
12. D. Knuth, Searching and Sorting, The Art of Computer Programming, Volume 3, Addison-Wesley, Reading, MA, 1973.
13. M. Kunde, Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound, Proc. First European Symposium on Algorithms, 1993, pp. 272-283.
14. T. Leighton, Tight Bounds on the Complexity of Parallel Sorting, IEEE Transactions on Computers 34(4) (1985), 344-354.
15. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercube, Morgan-Kaufmann, San Mateo, CA, 1992.
16. D. Nassimi and S. Sahni, Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network, Journal of the ACM 29(3) (1982), 642-667.
17. M. H. Nodine and J. S. Vitter, Large Scale Sorting in Parallel Memories, Proc. Third Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 29-39.
18. M. H. Nodine and J. S. Vitter, Greed Sort: Optimal Deterministic Sorting on Parallel Disks, Journal of the ACM 42(4) (1995), 919-933.
19. V. S. Pai, A. A. Schaffer, and P. J. Varman, Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging, Theoretical Computer Science 128(2) (1994), 211-239.
20. M. D. Pearson, Fast Out-of-Core Sorting on Parallel Disk Systems, Technical Report PCS-TR99-351, Computer Science Department, Dartmouth College, 1999, ftp://ftp.cs.dartmouth.edu/TR/TR99-351.ps.Z.
21. S. Rajasekaran, Sorting and Selection on Interconnection Networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 21, AMS, Providence, RI, 1995, pp. 275-296.
22. J. H. Reif and L. G. Valiant, A Logarithmic Time Sort for Linear Size Networks, Journal of the ACM 34(1) (1987), 60-76.
23. R. Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection, SIAM Journal of Computing 14(2) (1985), 396-409.
24. C. D. Thompson and H. T. Kung, Sorting on a Mesh Connected Parallel Computer, Communications of the ACM 20(4) (1977), 263-271.
25. J. S. Vitter and E. A. M. Shriver, Algorithms for Parallel Memory, I: Two-Level Memories, Algorithmica 12(2-3) (1994), 110-147.