Sciweavers

5553 search results - page 179 / 1111
» Parallel Implementation of Sch
Sort
View
141
Voted
ICPP
1993
IEEE
15 years 7 months ago
Data-Parallel R-Tree Algorithms
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
Erik G. Hoel, Hanan Samet
169
Voted
ICPP
1994
IEEE
15 years 7 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
HPCN
2000
Springer
15 years 7 months ago
ParIC: A Family of Parallel Incomplete Cholesky Preconditioners
A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decompo...
Mardochée Magolu monga Made, Henk A. van de...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Parallel Sorted Neighborhood Blocking with MapReduce
: Cloud infrastructures enable the efficient parallel execution of data-intensive tasks such as entity resolution on large datasets. We investigate challenges and possible solution...
Lars Kolb, Andreas Thor, Erhard Rahm
131
Voted
CONCURRENCY
2000
106views more  CONCURRENCY 2000»
15 years 3 months ago
Performance characteristics for OpenMP constructs on different parallel computer architectures
OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programmin...
Rudolf Berrendorf, Guido Nieken