A study of concurrent operations on R-trees
Information Sciences: an International Journal
Parallel Processing Algorithms for GIS
Parallel Processing Algorithms for GIS
A Parallel Intersection Algorithm for Vector Polygon Overlay
IEEE Computer Graphics and Applications
Master-Client R-Trees: A New Parallel R-Tree Architecture
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
An optimal algorithm for intersecting line segments in the plane
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Discovering Flow Anomalies: A SWEET Approach
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
CUDA by Example: An Introduction to General-Purpose GPU Programming
CUDA by Example: An Introduction to General-Purpose GPU Programming
Discovering interesting sub-paths in spatiotemporal datasets: a summary of results
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Change detection in time series data using wavelet footprints
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Hadoop: The Definitive Guide
Accelerating pathology image data cross-comparison on CPU-GPU hybrid systems
Proceedings of the VLDB Endowment
Lessons Learnt from the Development of GIS Application on Azure Cloud Platform
CLOUD '12 Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing
IPDPSW '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
MapReduce Algorithms for GIS Polygonal Overlay Processing
IPDPSW '13 Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Discovering persistent change windows in spatiotemporal datasets: a summary of results
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Hi-index | 0.00 |
It is imperative that for scalable solutions of GIS computations the modern hybrid architecture comprising a CPU-GPU pair is exploited fully. The existing parallel algorithms and data structures port reasonably well to multi-core CPUs, but poorly to GPGPUs because of latter's atypical fine-grained, single-instruction multiple-thread (SIMT) architecture, extreme memory hierarchy and coalesced access requirements, and delicate CPU-GPU coordination. Recently, our parallelization of the state-of-art interesting sequence discovery algorithms calculates one-dimensional interesting intervals over an image representing the normalized difference vegetation indices of Africa within 31 ms on an nVidia 480GTX. To our knowledge, this paper reports the first parallelization of these algorithms. This allowed us to process 612 images representing biweekly data from July 1981 through Dec 2006 within 22 seconds. We were also able to pipe the output to a display in almost real-time, which would interest climate scientists. We have also undertaken parallelization of two key tree-based data structures, namely R-tree and heap, and have employed parallel R-tree in polygon overlay system. These data structure parallelization are hard because of the underlying tree topology and the fine-grained computation leading to frequent access to such data structures severely stifling parallel efficiency.