Out-of-core computing on mesh connected computers

Journal of Parallel and Distributed Computing

Volumn 64, Issue 11, 2004, Pages 1311-1317

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

I O bottleneck; Mesh connected computers; Out of core computing; Packet routing; Parallel disks model; Parallel models of computing; Randomized computing; Sorting algorithms

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; MAGNETIC STORAGE; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

I/O BOTTLENECKS; MESH CONNECTED COMPUTERS; OUT-OF-CORE COMPUTING; PACKET ROUTING; PARALLEL DISKS MODEL; PARALLEL METHODS OF COMPUTING; RANDOMIZED COMPUTING; SORTING ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 7544237718     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.08.003     Document Type: Article

References (27)

1. A. Aggarwal, C.G. Plaxton, Optimal parallel sorting in multi-level storage, Proceedings of the Fifth Annual ACM Symposium on Discrete Algorithms, 1994, pp. 659-668.
2. A. Aggarwal, J.S. Vitter, The input/output complexity of sorting and related problems, Comm. ACM 31 (9) (1988) 1116-1127.
3. A.C. Arpaci-Dusseau, R.H. Arpaci-Dusseau, D.E. Culler, J.M. Hellerstein, D.A. Patterson, in: High performance sorting on networks of workstations, SIGMOD, 1997, pp. 243-254.
4. L. Arge, The buffer tree: anew technique for optimal I/O-algorithms, in: Proceedings of the fourth International Workshop on Algorithms and Data Structures (WADS), 1995, pp. 334-345.
5. R. Barve, E.F. Grove, J.S. Vitter, Simple randomized mergesort on parallel disks, Technical Report CS-1996-15, Department of Computer Science, Duke University, October 1996.
6. G. Chaudhry, T.H. Cormen, Getting more from out-of-core columnsort, in: Proceedings of the fourth Workshop on Algorithm Engineering and Experiments, 2002, pp. 143-154.
7. G. Chaudhry, T.H. Cormen, E.A. Hamon, Parallel out-of-core sorting: the third way, Cluster Comput., submitted, 2003.
8. G. Chaudhry, T.H. Cormen, L.F. Wisniewski, Columnsort lives! An efficient out-of-core sorting program, in: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 169-178.
9. T. Cormen, M.D. Pearson, Personal Communication, 1999.
10. F. Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari, Bulk synchronous parallel algorithms for the external memory model, Theory Comput. Systems 35 (2002) 567-597.
11. R. Dementiev, P. Sanders, Asynchronous parallel disk sorting, in: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, 2003, pp. 138-148.
12. G. Graefe, Parallel external sorting in volcano, Technical Report CU-CS-459-90, University of Colorado at Boulder, Department of Computer Science, March 1990.
13. M. Kaufmann, S. Rajasekaran, J.F. Sibeyn, Matching the bisection bound for routing and sorting on the mesh, in: Proceedings of the fourth Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 31-40.
14. M. Kunde, Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound, in: Proceedings of the First Annual European Symposium an Algorithms, Springer-Verlag Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 272-283.
15. T. Leighton, Tight bounds on the complexity of parallel sorting, IEEE Trans. Comput. C34 (4) (1985) 344-354.
16. T. Leighton, Introduction to Parallel Computing: Arrays-Trees-Hypercubes, Kluwer Academic Press, Dordrecht, 1992.
17. M.H. Nodine, J.S. Vitter, Large scale sorting in parallel memories, in: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 29-39.
18. M.H. Nodine, J.S. Viner, Greed sort optimal deterministic sorting on parallel disks, J. ACM 42 (4) (1995) 919-933.
19. V.S. Pai, A.A. Schaffer, P.J. Varman, Markov analysis of multiple-disk prefetching strategies for external merging, Theoret. Comput. Sci. 128 (2) (1994) 211-239.
20. M.D. Pearson, Fast out-of-core sorting on parallel disk systems, Technical Report PCS-TR99-351, Dartmouth College, Computer Science, Hanover, NH, June 1999, ftp://ftp.cs.dartmouth.edu/TR/TR99-351.ps.Z.
21. S. Rajasekaran, Sorting and selection on interconnection networks, in: D.F. Hsu, A. Rosenberg, D. Sotteau (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 21, 1995, pp. 275-296.
22. S. Rajasekaran, A framework for simple sorting algorithms on parallel disk systems, in: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998, pp. 88-97.
23. S. Rajasekaran, S. Sen, PDM sorting algorithms with a small number of passes, Technical Report BECAT/CSE-TR-04-9, University of Connecticut, June 2004.
24. S. Rajasekaran, S. Sen, A simple optimal randomized algorithm for sorting on the PDM, Technical Report BECAT/CSE-TR-04-8, University of Connecticut, June 2004.
25. C.D. Thompson, H.T. Kung, Sorting on a mesh connected parallel computer, Comm. ACM 20 (4) (1977) 263-271.
26. J.S. Vitter, D.A. Hutchinson, Distribution sort with randomized cycling, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 77-86.
27. J.S. Vitter, E.A.M. Shriver, Algorithms for parallel memory I: two-level memories, Algorithmica 12 (2-3) (1994) 110-147.