|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Ibraheem Al-furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka, "Parallel Construction of Multidimensional Binary Search Trees," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 2, pp. 136-148, February, 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/71.841750, author = {Ibraheem Al-furaih and Srinivas Aluru and Sanjay Goil and Sanjay Ranka}, title = {Parallel Construction of Multidimensional Binary Search Trees}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {2}, issn = {1045-9219}, year = {2000}, pages = {136-148}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.841750}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Parallel Construction of Multidimensional Binary Search Trees IS - 2 SN - 1045-9219 SP136 EP148 EPD - 136-148 A1 - Ibraheem Al-furaih, A1 - Srinivas Aluru, A1 - Sanjay Goil, A1 - Sanjay Ranka, PY - 2000 KW - k-d trees KW - hypercubes KW - meshes KW - multidimensional binary search trees KW - parallel algorithms KW - parallel computers. VL - 11 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of spatial data. The data structure is useful in several applications including graph partitioning, hierarchical applications such as molecular dynamics and
[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 Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
[4] G.E. Blelloch,Vector Models for Data-Parallel Computing. The 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, no. 3, pp. 165-172, 1975.
[8] G. Foxet al.,Solving Problems on Concurrent Processors, vol. I. Englewood Cliffs, NJ: Prentice Hall, 1988.
[9] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[10] F.P. Preparata and M.I. Shamos, Computational Geometry. 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.