Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICPP
1995
IEEE

favoriteEmaildiscussreport

107views Distributed And Parallel Com...» more ICPP 1995»

Data-Parallel Primitives for Spatial Operations

13 years 8 months ago

Data-Parallel Primitives for Spatial Operations

Download www.cs.umd.edu

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.

Erik G. Hoel, Hanan Samet

Real-time Traffic

Bucket Pmr Quadtree | Data-parallel Primitives | Distributed And Parallel Computing | ICPP 1995 | Main Memory |

claim paper

Related Content

» Performance of DataParallel Spatial Operations

» Use of rational numbers in the design of robust geometric primitives for threedimensional ...

» Spatial Data Mining Database Primitives Algorithms and Efficient DBMS Support

» A Spatial Logic for Concurrency

» Where am I Place instance and category recognition using spatial PACT

» Automated Nanomanipulation with Atomic Force Microscopes

» Exposing DataLevel Parallelism in Sequential Image Processing Algorithms

» Spatial Data Management for Virtual Product Development

» Optimizing Memory Accesses For Spatial Computation

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	ICPP
Authors	Erik G. Hoel, Hanan Samet

Comments (0)