Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Compiler and runtime support for structured and block structured applications
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Supporting dynamic data structures on distributed-memory machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication operations on coarse-grained mesh architectures
Parallel Computing
Object-oriented runtime support for complex distributed data structures
Object-oriented runtime support for complex distributed data structures
Multidimensional binary search trees used for associative searching
Communications of the ACM
Portable Parallel Irregular Applications
PSLS '95 Proceedings of the International Workshop on Parallel Symbolic Languages and Systems
Parallel remapping algorithms for adaptive problems
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Multipol: A Distributed Data Structure Library
Multipol: A Distributed Data Structure Library
Scalable S-To-P Broadcasting on Message-Passing MPPs
IEEE Transactions on Parallel and Distributed Systems
Termination detection in data-driven parallel computations/applications
Journal of Parallel and Distributed Computing
Large-scale indexing of spatial data in distributed repositories: the SD-Rtree
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection trees and it captures relevant characteristics of parallel machines. The operations we consider include insertion, deletion, and range queries. We introduce parameters to control how much imbalance is tolerated at each processor and to specify the load to be achieved during balancing. When balancing, we first broadcast point counts of a data-dependent partition of the data. Based on this partition, we propose load balancing methods with different communication and computation requirements. We present initial experimental results for the Cray T3D.