Parallel Volume Rendering for Ocean Visualization in a Cluster of PCs Alexandre Coelho Marcio Nascimento Cristiana Bentes Maria Clicia S. de Castro Ricardo.

Slides:



Advertisements
Similar presentations
National Institute of Advanced Industrial Science and Technology Ninf-G - Core GridRPC Infrastructure Software OGF19 Yoshio Tanaka (AIST) On behalf.
Advertisements

Reconstruction from Voxels (GATE-540)
University of Chicago Department of Energy The Parallel and Grid I/O Perspective MPI, MPI-IO, NetCDF, and HDF5 are in common use Multi TB datasets also.
Christian Delbe1 Christian Delbé OASIS Team INRIA -- CNRS - I3S -- Univ. of Nice Sophia-Antipolis November Automatic Fault Tolerance in ProActive.
Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500 Cluster.
WSCG 2007 Memory Efficient and Robust Software Implementation of the Raycast Algorithm Aline Pina COPPE/UFRJ Rio de Janeiro - Brazil
Cost-based Workload Balancing for Ray Tracing on a Heterogeneous Platform Mario Rincón-Nigro PhD Showcase Feb 17 th, 2012.
A Grid Parallel Application Framework Jeremy Villalobos PhD student Department of Computer Science University of North Carolina Charlotte.
Memory-Savvy Distributed Interactive Ray Tracing David E. DeMarle Christiaan Gribble Steven Parker.
Parallel Programming Henri Bal Vrije Universiteit Faculty of Sciences Amsterdam.
Memory Efficient Acceleration Structures and Techniques for CPU-based Volume Raycasting of Large Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller.
Efficient Parallelization for AMR MHD Multiphysics Calculations Implementation in AstroBEAR.
Parallel Rendering Ed Angel
Parallel Programming Henri Bal Vrije Universiteit Faculty of Sciences Amsterdam.
Task Based Execution of GPU Applications with Dynamic Data Dependencies Mehmet E Belviranli Chih H Chou Laxmi N Bhuyan Rajiv Gupta.
FLANN Fast Library for Approximate Nearest Neighbors
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Design and Implementation of a Single System Image Operating System for High Performance Computing on Clusters Christine MORIN PARIS project-team, IRISA/INRIA.
ADLB Update Recent and Current Adventures with the Asynchronous Dynamic Load Balancing Library Rusty Lusk Mathematics and Computer Science Division Argonne.
Load Balancing Dan Priece. What is Load Balancing? Distributed computing with multiple resources Need some way to distribute workload Discreet from the.
SSI-OSCAR A Single System Image for OSCAR Clusters Geoffroy Vallée INRIA – PARIS project team COSET-1 June 26th, 2004.
Parallel Rendering 1. 2 Introduction In many situations, standard rendering pipeline not sufficient ­Need higher resolution display ­More primitives than.
A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,
Efficient Volume Visualization of Large Medical Datasets Stefan Bruckner Institute of Computer Graphics and Algorithms Vienna University of Technology.
Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500, clusters,
A Fast Simulation Method Using Overlapping Grids for Interactions between Smoke and Rigid Objects Yoshinori Dobashi (Hokkaido University) Tsuyoshi Yamamoto.
A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.
Computational issues in Carbon nanotube simulation Ashok Srinivasan Department of Computer Science Florida State University.
Cluster-based SNP Calling on Large Scale Genome Sequencing Data Mucahid KutluGagan Agrawal Department of Computer Science and Engineering The Ohio State.
Performance Model & Tools Summary Hung-Hsun Su UPC Group, HCS lab 2/5/2004.
Benchmarking MapReduce-Style Parallel Computing Randal E. Bryant Carnegie Mellon University.
Simulated vascular reconstruction in a virtual operating theatre Robert G. Belleman, Peter M.A. Sloot Section Computational Science, University of Amsterdam,
Introduction to Parallel Rendering Jian Huang, CS 594, Spring 2002.
Heavy and lightweight dynamic network services: challenges and experiments for designing intelligent solutions in evolvable next generation networks Laurent.
Parallel Rendering. 2 Introduction In many situations, a standard rendering pipeline might not be sufficient ­Need higher resolution display ­More primitives.
(Short) Introduction to Parallel Computing CS 6560: Operating Systems Design.
Supercomputing ‘99 Parallelization of a Dynamic Unstructured Application using Three Leading Paradigms Leonid Oliker NERSC Lawrence Berkeley National Laboratory.
Parallelization of Classification Algorithms For Medical Imaging on a Cluster Computing System 指導教授 : 梁廷宇 老師 系所 : 碩光通一甲 姓名 : 吳秉謙 學號 :
Service - Oriented Middleware for Distributed Data Mining on the Grid ,劉妘鑏 Antonio C., Domenico T., and Paolo T. Journal of Parallel and Distributed.
Issues Autonomic operation (fault tolerance) Minimize interference to applications Hardware support for new operating systems Resource management (global.
NIH Resource for Biomolecular Modeling and Bioinformatics Beckman Institute, UIUC NAMD Development Goals L.V. (Sanjay) Kale Professor.
A High Performance Middleware in Java with a Real Application Fabrice Huet*, Denis Caromel*, Henri Bal + * Inria-I3S-CNRS, Sophia-Antipolis, France + Vrije.
GVis: Grid-enabled Interactive Visualization State Key Laboratory. of CAD&CG Zhejiang University, Hangzhou
*Partially funded by the Austrian Grid Project (BMBWK GZ 4003/2-VI/4c/2004) Making the Best of Your Data - Offloading Visualization Tasks onto the Grid.
LLNL-PRES DRAFT This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract.
Department of Computer Science MapReduce for the Cell B. E. Architecture Marc de Kruijf University of Wisconsin−Madison Advised by Professor Sankaralingam.
Electronic visualization laboratory, university of illinois at chicago Visualizing Very Large Scale Earthquake Simulations (SC 2003) K.L.Ma, UC-Davis.
Parallelization Strategies Laxmikant Kale. Overview OpenMP Strategies Need for adaptive strategies –Object migration based dynamic load balancing –Minimal.
High Performance LU Factorization for Non-dedicated Clusters Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa (University of Tokyo) and the future.
Parallel Programming Henri Bal Vrije Universiteit Faculty of Sciences Amsterdam.
1 Rocket Science using Charm++ at CSAR Orion Sky Lawlor 2003/10/21.
Cloud Computing – UNIT - II. VIRTUALIZATION Virtualization Hiding the reality The mantra of smart computing is to intelligently hide the reality Binary->
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
1 Supporting a Volume Rendering Application on a Grid-Middleware For Streaming Data Liang Chen Gagan Agrawal Computer Science & Engineering Ohio State.
Accelerating K-Means Clustering with Parallel Implementations and GPU Computing Janki Bhimani Miriam Leeser Ningfang Mi
Computer Science and Engineering Parallelizing Feature Mining Using FREERIDE Leonid Glimcher P. 1 ipdps’04 Scaling and Parallelizing a Scientific Feature.
Electronic Visualization Laboratory University of Illinois at Chicago “Fast And Reliable Space Leaping For Interactive Volume Rendering” by Ming Wan, Aamir.
Introduction to Load Balancing:
Ana Gainaru Aparna Sasidharan Babak Behzad Jon Calhoun
Supporting Fault-Tolerance in Streaming Grid Applications
Parallel I/O System for Massively Parallel Processors
Course Outline Introduction in algorithms and applications
Gengbin Zheng, Esteban Meneses, Abhinav Bhatele and Laxmikant V. Kale
Resource Allocation for Distributed Streaming Applications
Gary M. Zoppetti Gagan Agrawal Rishi Kumar
Automatic and Efficient Data Virtualization System on Scientific Datasets Li Weng.
Jeremy Meredith, Lawrence Livermore National Laboratory
L. Glimcher, R. Jin, G. Agrawal Presented by: Leo Glimcher
Presentation transcript:

Parallel Volume Rendering for Ocean Visualization in a Cluster of PCs Alexandre Coelho Marcio Nascimento Cristiana Bentes Maria Clicia S. de Castro Ricardo Farias – Geomática/UERJ – IME/UERJ – COPPE/UFRJ

Outline Volume Visualization Overview Parallel Rendering System Experimental Results Conclusions

What is Volume Visualization? Volumetric data images 3D data 2D plane Gains: –Understanding –Visual analysis and interpretation –Meaningful information

Volume Visualization Applications Medicine, Geology, Chemistry, Industry Geographical Information Systems –Ocean Modeling –Monitoring the atmospheric pollution –Terrain Modeling –Analyzing natural phenomena (cyclones)

Volumetric Data Generated: –Sensors (CT scanner) –Simulation (Fluid Dynamic) –Measured Data (Ocean Buoys) Representation: –3D grid of voxels (Regular or Irregular)

Volume Visualization Methods Surface Rendering –Generates image of the surface –Throws away data between surfaces Direct Volume Rendering –Treats object as semi- transparent –Can see entire volume

Volume Visualization Methods Surface RenderingVolume Renderingx

Volume Rendering Challenge Large scale 3D data –Computational intensive –Unacceptably long time on uniprocessors

Efficient Volume Rendering Parallel Processing –Multiple processors: Parallel Machines Cluster of PCs

Parallel Volume Rendering Clusters of PCs Low cost High availability Easy to update Parallel Machines Good speedups Expensive

Our goal Parallel Volume Rendering System for Ocean Visualization –Efficient and scalable –Low-cost –All software implementation –Portable and Free software –Out-of-core execution

Our goal Allows Visualization of Ocean Inner Structure –Climate research –Offshore industries –Fishing and Mammal Management

The Parallel Rendering System DPZSweep –Based on PZSweep Sweeping plane paradigm Projection of the faces in depth order –Two modules: Pre-processing Parallel Rendering

The Parallel Rendering System Grid Generation Ocean data Octree Creation Irregular grid Octree Parallel Algorithm Pre-processing Parallel Rendering

Pre-Processing Grid Generation: –Latitude/Longitude data irregular grid

Pre-Processing Octree Creation: –Out-of-core execution Octree file

Parallel Rendering Algorithm Parallelization: –Breaking the screen into rectangles - tiles Image portion that can be computed independently

Parallel Rendering Algorithm Parallelization: –Breaking the screen into rectangles - tiles

Parallel Rendering Algorithm Tile distribution –Random assignment –Dynamic distribution

Parallel Rendering Algorithm Dynamic Load Balancing –Rebalance the work –Distributed information diffusion algorithms –Work stealing

Load Balancing Algorithms Nearest Neighbor (NN) –Steal work from the nearest neighbor Longest Queue (LQ) –Steal work from overloaded node –Token ring to distribute load information Circular Distribution (CD) –Dynamic distribution with token ring

Experimental Results Cluster: –16 processors –512M bytes –Fast Ethernet 100Mbits/sec –Linux –MPI

Ocean Dataset Gulf of Mexico Data– NRL/ERC-MSU –Thanks to Dr. Robert Moorhead Resolution: 1 degree latitude and longitude 6 depth levels 1 time step – Velocity 3 tetrahedralized versions: –Ocean (44K cells) –Ocean1 (356K cells) –Ocean2 (2854K cells)

Performance Analysis

Ocean Results

Conclusions Distributed parallel volume rendering for ocean datasets on cluster of PCs: –Dynamic load balancing – low overhead –Out-of-core execution –Portable and free software infrastructure Great reductions in execution time Allows ocean researchers to interactively visualize large volumes of 3D data

Future Work Fault-tolerance Grid execution Handheld interface Handling Time-varying data

For your attention. Thank you

Load Balancing Algorithms Nearest Neighbor Proc 1 Proc 0 Proc 2

Load Balancing Algorithms Nearest Neighbor Proc 0 Proc 1 Proc 2

Load Balancing Algorithms Nearest Neighbor Proc 0 Proc 1 Proc 2

Load Balancing Algorithms Nearest Neighbor Proc 0 Proc 1 Proc 2

Load Balancing Algorithms Nearest Neighbor Proc 0 Proc 1 Proc 2

Load Balancing Algorithms Longest Queue Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Longest Queue Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Longest Queue Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Longest Queue Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Circular Distribution

Load Balancing Algorithms Circular Distribution Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Circular Distribution Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Circular Distribution Proc 0 Proc 1 Proc 2 Proc

Load Balancing Algorithms Circular Distribution Proc 0 Proc 1 Proc 2 Proc