Parallel construction of multidimensional binary search trees

IEEE Transactions on Parallel and Distributed Systems

Volumn 11, Issue 2, 2000, Pages 136-148

  Al Furaih, Ibraheem ^b   Aluru, Srinivas ^a,c   Goil, Sanjay ^d   Ranka, Sanjay ^a,e  

^a IEEE   (United States)

^b Syracuse University   (United States)

^c Iowa State University   (United States)

^d Northwestern University   (United States)

^e J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HYPERCUBES; MULTIDIMENSIONAL BINARY SEARCH TREES; PARALLEL COMPUTERS;

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033871057     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.841750     Document Type: Article

References (14)

1. I. Al-furaih, S. Aluru, S. Goil, and S. Ranka, "Practical Algorithms for Selection on Coarse-Grained Parallel Computers," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 8, pp. 313-324, Aug. 1997.
2. J.L. Bentley, "Multidimensional Binary Search Trees in Database Applications," IEEE Trans. Software Eng., vol. 5, pp. 333-340, 1979.
3. J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Search," Comm. ACM, vol. 19, pp. 509-517, 1975.
4. G.E. Blelloch, Vector Modles for Data-Parallel Computing. Cambridge, Mass.: MIT Press, 1990.
5. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer Systems Science, vol. 7, pp. 448-461, 1972.
6. F. Ercal, "Heuristic Approaches to Task Allocation for Parallel Computing," PhD Thesis, Ohio State Univ., 1988.
7. R.W. Floyd and R.L. Rivest, "Expected Time Bounds for Selection," Comm. ACM, vol. 18, pp. 165-172, 1975.
8. G. Fox, Solving Problems on Concurrent Processors: Volume I - General Techniques and Regular Problems. Englewood Cliffs, N.J.: Prentice Hall, 1988.
9. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. San Francisco: Benjamin Cummings, 1994.
10. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
11. S. Rajasekharan, W. Chen, and S. Yooseph, "Unifying Themes for Parallel Selection," Proc. Fifth Int'l Symp. Algorithms and Computation, 1994.
12. S. Ranka, R.V. Shankar, and K.A. Alsabti, "Many-to-Many Communication with Bounded Traffic," Proc. Frontiers of Massively Parallel Computation, pp. 20-27, 1995.
13. A. Schonhage, M.S. Paterson, and N. Pippenger, "Finding the Median," J. Computer Systems Science, vol. 13, pp. 184-199, 1976.
14. H. Shi and J. Schaeffer, "Parallel Sorting by Regular Sampling," J. Parallel and Distributed Computing, vol. 14, pp. 361-370, 1992.