Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Efficient plane sweeping in parallel
SCG '86 Proceedings of the second annual symposium on Computational geometry
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Disk Allocation Methods Using Error Correcting Codes
IEEE Transactions on Computers
A generic solution to polygon clipping
Communications of the ACM
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Factoring: a method for scheduling parallel loops
Communications of the ACM
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Parallel computational geometry
Parallel computational geometry
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
An analysis and algorithm for polygon clipping
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Parallel Intersection Algorithm for Vector Polygon Overlay
IEEE Computer Graphics and Applications
Disk Allocation Methods for Parallelizing Grid Files
Proceedings of the Tenth International Conference on Data Engineering
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Load Balancing in High Performance GIS: Declustering Polygonal Maps
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Scheduling policies to support distributed 3D multimedia applications
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Clone join and shadow join: two parallel spatial join algorithms
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Storing spatial data on a network of workstations
Cluster Computing
A Parallel Spatial Join Processing for Distributed Spatial Databases
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Future Generation Computer Systems
Hi-index | 0.00 |
Declustering and load-balancing are important issues in designing a high-performance geographic information system (HPGIS), which is a central component of many interactive applications(such as real-time terrain visualization. The current literature provides efficient methods for declustering spatial point-data. However, there has been little work toward developing efficient declustering methods for collections of extended objects, like chains of line-segments and polygons. In this paper, we focus on the data-partitioning approach to parallelizing GIS operations. We provide a framework for declustering collections of extended spatial objects by identifying the following key issues: 1) the work-load metric, 2) the spatial-extent of the work-load, 3) the distribution of the work-load over the spatial-extent, and 4) the declustering method. We identify and experimentally evaluate alternatives for each of these issues. In addition, we also provide a framework for dynamically balancing the load between different processors. We experimentally evaluate the proposed declustering and load-balancing methods on a distributed memory MIMD machine (Cray T3D). Experimental results show that the spatial-extent and the work-load metric are important issues in developing a declustering method. Experiments also show that the replication of data is usually needed to facilitate dynamic load-balancing, since the cost of local processing is often less than the cost of data transfer for extended spatial objects. In addition, we also show that the effectiveness of dynamic load-balancing techniques can be improved by using declustering methods to determine the subsets of spatial objects to be transferred during runtime.