Data-Parallel Primitives for Spatial Operations

Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these two data structures that make use of these primitives. The data-parallel algorithms are assumed to be main memory resident. They were implemented on a Thinking Machines CM-5 with 32 processors containing 1GB of main memory.

• Type: Conference
• Year: 1995
• Where: ICPP
• Authors: Erik G. Hoel, Hanan Samet
• Keywords: Bucket Pmr Quadtree, Data-parallel Primitives, Distributed And Parallel Computing, ICPP 1995, Main Memory