2009 AAG Annual Meeting Las Vegas, NV March 25th, 2009

Slides:



Advertisements
Similar presentations
Lecture 12: MapReduce: Simplified Data Processing on Large Clusters Xiaowei Yang (Duke University)
Advertisements

A Large-Grained Parallel Algorithm for Nonlinear Eigenvalue Problems Using Complex Contour Integration Takeshi Amako, Yusaku Yamamoto and Shao-Liang Zhang.
MAP REDUCE PROGRAMMING Dr G Sudha Sadasivam. Map - reduce sort/merge based distributed processing Best for batch- oriented processing Sort/merge is primitive.
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
SLA-Oriented Resource Provisioning for Cloud Computing
Class CS 775/875, Spring 2011 Amit H. Kumar, OCCS Old Dominion University.
An Open-Source, Object-Oriented General Cartographic Transformation Program (GCTP) Michael S. Williams, Michael P. Finn*, and Robert A. Buehler** United.
GridRPC Sources / Credits: IRISA/IFSIC IRISA/INRIA Thierry Priol et. al papers.
Cyberinfrastructure for Scalable and High Performance Geospatial Computation Xuan Shi Graduate assistants supported by the CyberGIS grant Fei Ye (2011)
OpenFOAM on a GPU-based Heterogeneous Cluster
Rapid Raster Projection Transformation and Web Service Using High-performance Computing Technology 2009 AAG Annual Meeting Las Vegas, NV March 25 th, 2009.
Reference: Message Passing Fundamentals.
Cross Cluster Migration Remote access support Adianto Wibisono supervised by : Dr. Dick van Albada Kamil Iskra, M. Sc.
Lecture 2 – MapReduce CPE 458 – Parallel Programming, Spring 2009 Except as otherwise noted, the content of this presentation is licensed under the Creative.
Numerical Grid Computations with the OPeNDAP Back End Server (BES)
ADLB Update Recent and Current Adventures with the Asynchronous Dynamic Load Balancing Library Rusty Lusk Mathematics and Computer Science Division Argonne.
Introduction to Parallel Programming MapReduce Except where otherwise noted all portions of this work are Copyright (c) 2007 Google and are licensed under.
GmImgProc Alexandra Olteanu SCPD Alexandru Ştefănescu SCPD.
An approach for solving the Helmholtz Equation on heterogeneous platforms An approach for solving the Helmholtz Equation on heterogeneous platforms G.
1 Babak Behzad, Yan Liu 1,2,4, Eric Shook 1,2, Michael P. Finn 5, David M. Mattli 5 and Shaowen Wang 1,2,3,4 Babak Behzad 1,3, Yan Liu 1,2,4, Eric Shook.
U.S. Department of the Interior U.S. Geological Survey Accurate Projection of Small-Scale Raster Datasets 21 st International Cartographic Conference 10.
Parallel Computing for Urban Cellular Automata Qingfeng. Gene. Guan 2004-Nov-18 Geography Department Colloquium Univ. of California, Santa Barbara.
A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.
U.S. Department of the Interior U.S. Geological Survey Reprojecting Raster Data of Global Extent Auto-Carto 2005: A Research Symposium March, 2005.
Cluster-based SNP Calling on Large Scale Genome Sequencing Data Mucahid KutluGagan Agrawal Department of Computer Science and Engineering The Ohio State.
Small-Scale Raster Map Projection Transformation Using a Virtual System to Interactively Share Computing Resources and Data U.S. Department of the Interior.
Conclusions and Future Considerations: Parallel processing of raster functions were 3-22 times faster than ArcGIS depending on file size. Also, processing.
Introduction to Parallel Rendering Jian Huang, CS 594, Spring 2002.
Efficient Data Accesses for Parallel Sequence Searches Heshan Lin (NCSU) Xiaosong Ma (NCSU & ORNL) Praveen Chandramohan (ORNL) Al Geist (ORNL) Nagiza Samatova.
Improving I/O with Compiler-Supported Parallelism Why Should We Care About I/O? Disk access speeds are much slower than processor and memory access speeds.
A Fault-Tolerant Environment for Large-Scale Query Processing Mehmet Can Kurt Gagan Agrawal Department of Computer Science and Engineering The Ohio State.
GEM: A Framework for Developing Shared- Memory Parallel GEnomic Applications on Memory Constrained Architectures Mucahid Kutlu Gagan Agrawal Department.
CS- 492 : Distributed system & Parallel Processing Lecture 7: Sun: 15/5/1435 Foundations of designing parallel algorithms and shared memory models Lecturer/
A N I N - MEMORY F RAMEWORK FOR E XTENDED M AP R EDUCE 2011 Third IEEE International Conference on Coud Computing Technology and Science.
CS 420 Design of Algorithms Parallel Algorithm Design.
U.S. Department of the Interior U.S. Geological Survey Projecting Global Raster Databases July 11, 2002 Joint International Symposium on GEOSPATIAL THEORY,
Yinglei Cheng1,2, Ying Li2, Rongchun Zhao2 2010/01/07 黃千峰 A Parallel Image Fusion Algorithm Based on Wavelet Packet.
COMP7330/7336 Advanced Parallel and Distributed Computing Task Partitioning Dr. Xiao Qin Auburn University
COMP7330/7336 Advanced Parallel and Distributed Computing Task Partitioning Dynamic Mapping Dr. Xiao Qin Auburn University
Computer Science and Engineering Parallelizing Feature Mining Using FREERIDE Leonid Glimcher P. 1 ipdps’04 Scaling and Parallelizing a Scientific Feature.
1 Parallel Mining of Closed Sequential Patterns Shengnan Cong, Jiawei Han, David Padua Proceeding of the 11th ACM SIGKDD international conference on Knowledge.
Fast Data Analysis with Integrated Statistical Metadata in Scientific Datasets By Yong Chen (with Jialin Liu) Data-Intensive Scalable Computing Laboratory.
Application of Design Patterns to Geometric Decompositions V. Balaji, Thomas L. Clune, Robert W. Numrich and Brice T. Womack.
Lecture 3 – MapReduce: Implementation CSE 490h – Introduction to Distributed Computing, Spring 2009 Except as otherwise noted, the content of this presentation.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
A Parallel Communication Infrastructure for STAPL
Optimizing Distributed Actor Systems for Dynamic Interactive Services
Auburn University
Generalized and Hybrid Fast-ICA Implementation using GPU
Jeremy Martin Alex Tiskin
Miraj Kheni Authors: Toyotaro Suzumura, Koji Ueno
Imageodesy for co-seismic shift study
Conception of parallel algorithms
Parallel Programming By J. H. Wang May 2, 2017.
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Mapping Techniques Dr. Xiao Qin Auburn University.
Parallel and Distributed Simulation Techniques
Parallel Algorithm Design
Implementing Simplified Molecular Dynamics Simulation in Different Parallel Paradigms Chao Mei April 27th, 2006 CS498LVK.
TerraForm3D Plasma Works 3D Engine & USGS Terrain Modeler
A Distributed Bucket Elimination Algorithm
MapReduce Simplied Data Processing on Large Clusters
Mihir Awatramani Lakshmi kiran Tondehal Xinying Wang Y. Ravi Chandra
Numerical Algorithms Quiz questions
Channels.
Parallel Algorithm Models
Department of Computer Science, University of Tennessee, Knoxville
Parallel Exact Stochastic Simulation in Biochemical Systems
Excursions into Parallel Programming
L. Glimcher, R. Jin, G. Agrawal Presented by: Leo Glimcher
Presentation transcript:

Rapid Raster Projection Transformation and Web Service Using High-performance Computing Technology 2009 AAG Annual Meeting Las Vegas, NV March 25th, 2009 Qingfeng (Gene) Guan Michael P. Finn E. Lynn Usery David M. Mattli Center of Excellence for Geospatial Information Science U.S. Geological Survey Rolla, MO

Contents Motivations Parallelizing raster projection transformation Static load-balancing Dynamic load-balancing pRPL – parallel Raster Processing programming Library Conclusions

Motivations Massive data volumes Re-sampling method Example: High resolutions Large areas Easily 500MB+ Re-sampling method Multiple projection transformations for each output pixel (center and corners) Example: Global land-cover at 30-sec resolution, 21,600X43,200 pixels, 900 MB Geographic → Mollweide Laptop, Intel Pentinum M 1.5 GHz, 1.25 GB RAM 45 minutes 10 seconds!!

Inverse Projection Transformation

Motivations Problem: High computational intensity v.s. demand for rapid projection (web) service Solution: High-performance computing technologies Parallel computing

Parallel approach for raster data Raster is born to be parallelized A raster dataset is essentially a matrix of values, each of which represents the attribute of the corresponding cell of the field A matrix can be easily partitioned into sub-matrices and assigned onto multiple processors so that the sub-matrices can be processed simultaneously

Parallelizing Projection Transformation Output image is decomposed Minimum Bounding Rectangles (MBRs) of sub-input-images are computed using the MBRs of sub-output-images

Parallelizing Projection Transformation Static Load-balancing

Parallelizing Projection Transformation Dynamic Load-balancing Reduced granularity Master reads sub-input-images and distributes them in response to requests Workers/Slavers request for new tasks (MBRs of sub-output-images & corresponding sub-input-images)

Parallelizing Projection Transformation Dynamic Load-balancing

pRPL: parallel Raster Processing Library An open-source general-purpose parallel Raster Processing programming Library Encapsulates complex parallel computing utilities and routines specifically for raster processing Enables the implementation of parallel raster-processing algorithms without requiring a deep understanding of parallel computing and programming Possible usage Massive-volume geographic raster processing Image (including remote sensing imagery) processing Cellular Automata (CA) and Agent-based Modeling (ABM) Freely downloadable and open source http://sourceforge.net/projects/prpl/

pRPL (cont.) Object-Oriented programming style Written in C++ Built upon the Message Passing Interface (MPI) Provides Transparent Parallelism Supports almost all types of raster-based processing Local-scope Neighborhood-scope Regional-scope Global-scope

pRPL 2.0 – under development Supports dynamic load-balancing for data parallelism Master-worker formation Master Reads data dynamnically Distributes the initial subsets to the workers Maintains the task farm which contains the remaining subsets of data Sends the subsets to the workers in respond to requests Receives completed output subsets from workers Workers/Slavers Initially assigned with some subsets of data Request for more data when finish the assigned subsets Receive new input subsets to process from the master Submit completed output subsets to the master

Conclusions Massive-volume raster projection transformation needs high-performance computing technology Dynamic load-balancing technique improves performance Reduces the I/O overhead and the requirement for memery space Improves the utilitization rate (efficiency) of a heterogenerous parallel computing system pRPL reduces the devolopment complexity of a parallel raster-based processing

Thank You! Questions & Comments?

Your Topic Goes Here Your Subtopics Go Here

Your Topic Goes Here Your Subtopics Go Here

elements www.animationfactory.com