This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th International Parallel Processing Symposium (IPPS '97)
Maintaining Spatial Data Sets in Distributed-Memory Machines
Geneva, SWITZERLAND
April 01-April 05
ISBN: 0-8186-7792-9
Susanne E. Hambrusch, Purdue University, University of Delaware
Ashfaq A. Khokhar, Purdue University, University of Delaware
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.
Citation:
Susanne E. Hambrusch, Ashfaq A. Khokhar, "Maintaining Spatial Data Sets in Distributed-Memory Machines," ipps, pp.702, 11th International Parallel Processing Symposium (IPPS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.