Parallel Computation of 2D Morse-Smale Complexes

Slides:



Advertisements
Similar presentations
Divide and Conquer Yan Gu. What is Divide and Conquer? An effective approach to designing fast algorithms in sequential computation is the method known.
Advertisements

Exploiting Graphics Processors for High- performance IP Lookup in Software Routers Author: Jin Zhao, Xinya Zhang, Xin Wang, Yangdong Deng, Xiaoming Fu.
Weekly Report Ph.D. Student: Leo Lee date: Oct. 9, 2009.
GPU Computing with CUDA as a focus Christie Donovan.
lecture 4 : Isosurface Extraction
Data Analysis and Visualization Using the Morse-Smale complex
CUDA Programming Lei Zhou, Yafeng Yin, Yanzhi Ren, Hong Man, Yingying Chen.
Evolutionary Computing and the Traveling Salesman
CISC 879 : Software Support for Multicore Architectures John Cavazos Dept of Computer & Information Sciences University of Delaware
Accelerating Marching Cubes with Graphics Hardware Gunnar Johansson, Linköping University Hamish Carr, University College Dublin.
Acceleration on many-cores CPUs and GPUs Dinesh Manocha Lauri Savioja.
CS 732: Advance Machine Learning Usman Roshan Department of Computer Science NJIT.
DB system design for new hardware and sciences Anastasia Ailamaki École Polytechnique Fédérale de Lausanne and Carnegie Mellon University.
Venkatram Ramanathan 1. Motivation Evolution of Multi-Core Machines and the challenges Background: MapReduce and FREERIDE Co-clustering on FREERIDE Experimental.
Dax: Rethinking Visualization Frameworks for Extreme-Scale Computing DOECGF 2011 April 28, 2011 Kenneth Moreland Sandia National Laboratories SAND P.
Claude Tadonki Mines ParisTech – CRI – Mathématiques et Systèmes Laboratoire de l’Accélérateur Linéaire/IN2P3/CNRS France 2nd.
Utilizing Multi-threading, Parallel Processing, and Memory Management Techniques to Improve Transportation Model Performance Jim Lam Andres Rabinowicz.
computer
Distributed Multigrid for Processing Huge Spherical Images Michael Kazhdan Johns Hopkins University.
Multiprocessing. Going Multi-core Helps Energy Efficiency William Holt, HOT Chips 2005 Adapted from UC Berkeley "The Beauty and Joy of Computing"
A Parallel Implementation of MSER detection GPGPU Final Project Lin Cao.
Implementing GIST on the GPU. Refrence Original Work  Aude Oliva, Antonio Torralba  Modeling the shape of the scene: a holistic representation of the.
Jie Chen. 30 Multi-Processors each contains 8 cores at 1.4 GHz 4GB GDDR3 memory offers ~100GB/s memory bandwidth.
Efficient Local Statistical Analysis via Integral Histograms with Discrete Wavelet Transform Teng-Yok Lee & Han-Wei Shen IEEE SciVis ’13Uncertainty & Multivariate.
High Quality Silhouette Illustration for Texture Based Volume Rendering, Nagy and Klein.
CDVS on mobile GPUs MPEG 112 Warsaw, July Our Challenge CDVS on mobile GPUs  Compute CDVS descriptor from a stream video continuously  Make.
PARALLELIZATION OF ARTIFICIAL NEURAL NETWORKS Joe Bradish CS5802 Fall 2015.
Scientific Computing on Graphics Hardware Robert Strzodka, Dominik G ö ddeke Reading, UK, May
Big data Usman Roshan CS 675. Big data Typically refers to datasets with very large number of instances (rows) as opposed to attributes (columns). Data.
Programming with CUDA WS 08/09 Lecture 1 Tue, 21 Oct, 2008.
Igor Jánoš. Goal of This Project Decode and process a full-HD video clip using only software resources Dimension – 1920 x 1080 pixels.
1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:
Martin Kruliš by Martin Kruliš (v1.1)1.
Sudhanshu Khemka.  Treats each document as a vector with one component corresponding to each term in the dictionary  Weight of a component is calculated.
Shouqing Hao Institute of Computing Technology, Chinese Academy of Sciences Processes Scheduling on Heterogeneous Multi-core Architecture.
CSci6702 Parallel Computing Andrew Rau-Chaplin
CS 732: Advance Machine Learning
Presented by: Dardan Xhymshiti Spring 2016:. Authors: Publication:  ICDM 2015 Type:  Research Paper 2 Sean Chester*Darius Sidlauskas`Ira Assent*Kenneth.
ACCELERATING VIRUS SCANNING WITH GPU Project by: Sinthuja K. Thipakar S. Computer Engineering Department, University of Peradeniya.
Processor Level Parallelism 2. How We Got Here Developments in PC CPUs.
Matthew Royle Supervisor: Prof Shaun Bangay.  How do we implement OpenCL for CPUs  Differences in parallel architectures  Is our CPU implementation.
GPU ProgrammingOther Relevant ObservationsExperiments GPU kernels run on C blocks (CTAs) of W warps. Each warp is a group of w=32 threads, which are executed.
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Parallel Hardware Dr. Xiao Qin Auburn.
Brad Baker, Wayne Haney, Dr. Charles Choi
Potential Project.
Quiz for Week #5.
Parallel Computing Lecture
Salient Contour Extraction Using Contour Tee
Towards Topology-Rich Visualization/Analysis
Implementation of Efficient Check-pointing and Restart on CPU - GPU
Parallel Processing and GPUs
HI !.
Motivation Need a stable way to extract the filament structure of the material In general we don’t know the scale of simulation Want a result that is invariant.
Divide and Conquer Methodology
“The Brain”… I will rule the world!
Learn about MATLAB Engineers – not sales!
TUTORIAL1 VECTOR ANALYSIS PROBLEM SET(2)
Topological Ordering Algorithm: Example
Morse Set Classification and Hierarchical Refinement using Conley Index Morse decompositions of vector fields is a reliable topological analysis for vector.
Compile-time Frequency Scaling for CPU Energy and EDP Improvement
Fawkner S.C Coaching curriculum implementation : 2016
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Rocky K. C. Chang September 11, 2018
Portable Performance for Many-Core Particle Advection
FREERIDE: A Framework for Rapid Implementation of Datamining Engines
Paper Review Zhiqiang 9/21/12
Գագաթի որոնում (Peak Finder)
Topological Ordering Algorithm: Example
Divide 9 × by 3 ×
Presentation transcript:

Parallel Computation of 2D Morse-Smale Complexes Efficient scalar field Topology analysis Parallel Computation of 2D Morse-Smale Complexes Implementable on multicore CPUs and GPUs Divide and conquer for out-of-core processing Hi. I’ll be presenting our work on computing a gradient based topological data structure called the Morse smale complex. Our algorithm is implemented on parallel environments such as mutlicore CPU’s and GPU’s. The algorithm scales to large datasets using a divide and conquer method while guarenteeing topological consistency. To find out more attend the session on “Parallel computation on 2D Morse-Smale complexes”, at evening session on Tuesday 16th oct at the Grand Ballroom D.