GPU-Accelerated Route Planning for Computer Generated Forces

Slides:



Advertisements
Similar presentations
DirectX11 Performance Reloaded
Advertisements

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware.
COMPUTER GRAPHICS CS 482 – FALL 2014 NOVEMBER 10, 2014 GRAPHICS HARDWARE GRAPHICS PROCESSING UNITS PARALLELISM.
IIAA GPMAD A beam dynamics code using Graphics Processing Units GPMAD (GPU Processed Methodical Accelerator Design) utilises Graphics Processing Units.
Visibility Culling. Back face culling View-frustrum culling Detail culling Occlusion culling.
Visibility Culling using Hierarchical Occlusion Maps Hansong Zhang, Dinesh Manocha, Tom Hudson, Kenneth E. Hoff III Presented by: Chris Wassenius.
Proximity Computations between Noisy Point Clouds using Robust Classification 1 Jia Pan, 2 Sachin Chitta, 1 Dinesh Manocha 1 UNC Chapel Hill 2 Willow Garage.
Raster Based GIS Analysis
Rasterization and Ray Tracing in Real-Time Applications (Games) Andrew Graff.
Multi Agent Simulation and its optimization over parallel architecture using CUDA™ Abdur Rahman and Bilal Khan NEDUET(Department Of Computer and Information.
Computer Graphics Hardware Acceleration for Embedded Level Systems Brian Murray
Slide 1 OneSAF Objective System (OOS) Overview Marlo Verdesca, Eric Root, Jaeson Munro
Bounding Volume Hierarchy “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presented by Mathieu Brédif.
GH05 KD-Tree Acceleration Structures for a GPU Raytracer Tim Foley, Jeremy Sugerman Stanford University.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
02/22/ Manocha Interactive Modeling and Simulation using Graphics Processors Dinesh Manocha University of North Carolina at Chapel Hill
Interactive Shadow Generation in Complex Environments Naga K. Govindaraju, Brandon Lloyd, Sung-Eui Yoon, Avneesh Sud, Dinesh Manocha Speaker: Alvin Date:
DDDDRRaw: A Prototype Toolkit for Distributed Real-Time Rendering on Commodity Clusters Thu D. Nguyen and Christopher Peery Department of Computer Science.
Geometric Sound Propagation Anish Chandak & Dinesh Manocha UNC Chapel Hill
Introduction General Data Structures - Arrays, Linked Lists - Stacks & Queues - Hash Tables & Binary Search Trees - Graphs Spatial Data Structures -Why.
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
Bounding Volume Hierarchies and Spatial Partitioning Kenneth E. Hoff III COMP-236 lecture Spring 2000.
Acceleration on many-cores CPUs and GPUs Dinesh Manocha Lauri Savioja.
Technology to the Warfighter Quicker Stream Processing for Computer Generated Forces Kickoff Meeting Maria Bauer RDECOM-STTC.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Collision Detection for Deformable Objects Xin Huang 16/10/2007.
11/28/ Manocha Interactive CGF Computations using COTS Graphics Processors Dinesh Manocha University of North Carolina at Chapel Hill
1 Occlusion Culling ©Yiorgos Chrysanthou, , Anthony Steed, 2004.
Ray Tracing and Photon Mapping on GPUs Tim PurcellStanford / NVIDIA.
GPU-accelerated Evaluation Platform for High Fidelity Networking Modeling 11 December 2007 Alex Donkers Joost Schutte.
Invitation to Computer Science 5th Edition
REAL-TIME NAVIGATION OF INDEPENDENT AGENTS USING ADAPTIVE ROADMAPS Avneesh Sud 1, Russell Gayle 2, Erik Andersen 2, Stephen Guy 2, Ming Lin 2, Dinesh Manocha.
Quick-CULLIDE: Efficient Inter- and Intra- Object Collision Culling using Graphics Hardware Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha University.
Parallelization and Characterization of Pattern Matching using GPUs Author: Giorgos Vasiliadis 、 Michalis Polychronakis 、 Sotiris Ioannidis Publisher:
NIH Resource for Biomolecular Modeling and Bioinformatics Beckman Institute, UIUC NAMD Development Goals L.V. (Sanjay) Kale Professor.
Interactive Rendering With Coherent Ray Tracing Eurogaphics 2001 Wald, Slusallek, Benthin, Wagner Comp 238, UNC-CH, September 10, 2001 Joshua Stough.
Fast BVH Construction on GPUs (Eurographics 2009) Park, Soonchan KAIST (Korea Advanced Institute of Science and Technology)
David Luebke11/26/2015 CS 551 / 645: Introductory Computer Graphics David Luebke
Analysing Miss O’Grady. Analysing Analysing is the interpretation of the data. It involves examining the data and giving meaning to it. When data has.
Performance Tuning John Black CS 425 UNR, Fall 2000.
Modeling and control of a Stewart Platform (Hexapod Mount) 1 Frank Janse van Vuuren Supervisor: Dr Y. Kim.
Distributed Spanning Tree Center for Information Security Department of Computer Science University of Tulsa, Tulsa, OK
GAM666 – Introduction To Game Programming ● Programmer's perspective of Game Industry ● Introduction to Windows Programming ● 2D animation using DirectX.
Game Engine Design Quake Engine Presneted by Holmes 2002/12/2.
CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Presented by Marcus Parker By Naga K. Govindaraju,
Veysi ISLER, Department of Computer Engineering, Middle East Technical University, Ankara, TURKEY Spring
United States Army Combined Arms Center A next generation simulation architecture supporting both Computer Generated Forces (CGF) and SAF operations Provides.
CG-UFRGS Real-Time Multi-Agent Path Planning on Arbitrary Surfaces Rafael P. Torchelsen 1, Luiz F. Scheidegger 1, Guilherme N. Oliveira 1, Rui Bastos 2,
General Purpose computing on Graphics Processing Units
GPU Architecture and Its Application
FastHASH: A New Algorithm for Fast and Comprehensive Next-generation Sequence Mapping Hongyi Xin1, Donghyuk Lee1, Farhad Hormozdiari2, Can Alkan3, Onur.
Lecture 2: Performance Evaluation
Scene Manager Creates and places movable objects like lights and cameras so as to access them efficiently, e.g. for rendering. Loads and assembles world.
Bounding Volume Hierarchies and Spatial Partitioning
Hybrid BDD and All-SAT Method for Model Checking
Deep Learning in HEP Large number of applications:
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Scalability of Intervisibility Testing using Clusters of GPUs
Informix Red Brick Warehouse 5.1
Bounding Volume Hierarchies and Spatial Partitioning
Introduction to Parallelism.
Real-Time Ray Tracing Stefan Popov.
CDA 6938 Final Project Triangulation from Point Cloud
Hybrid Ray Tracing of Massive Models
Computer-Generated Force Acceleration using GPUs: Next Steps
Roland Geraerts and Mark Overmars CASA’08
Visibility Computations
Young J. Kim Ming C. Lin Dinesh Manocha
CS703 - Advanced Operating Systems
Reporter: Wenkai Cui Institution: Tsinghua University Date:
Search-Based Approaches to Accelerate Deep Learning
Presentation transcript:

GPU-Accelerated Route Planning for Computer Generated Forces UNC-CH/PEOSTRI/RDECOM/SAIC Our goals is to use the commodity GPUs for CGF computations (esp. the OneSAF). The goal is to map some of the OneSAF computations onto the GPUs. Start point Terrain Features And Route Segments Render Features (Once) Feature Buffer (static) Generated Route Segments Full Feature set Features Lake Cull segment set against feature set (GPU) Reduced segments Features: lakes, rivers, trees, buildings, etc. Cull feature set against segment set (GPU) River End point Reduced features and segments Issues Concerning Route Planning for Computer Generated Forces (CGF) High computational complexity Widely applicable in simulation development Can consume 50% of simulation time Intersection calculations bottleneck route planning Cull feature set against Single segment (GPU) Exact feature/segment Tests (CPU) Results Current Status of Graphics Processing Units (GPUs) Integral part of modern computers Performance increases faster than Moore’s Law Additional computational power to assist CPU Optimizations Culling is performed using the GPU’s occlusion query capability. Each successive step reduces the number of segments and features that are tested in the subsequent steps Final group tested by the CPU is minimized Conservatively expand feature and segment sizes to avoid inaccuracy in calculations input 1 3 2 Overview of GPU-Accelerated Route Planning Ability to test multiple route segments in parallel Queries all potential segments faster than individually testing on the CPU More efficient search of the large planning space System integrated with OneSAF Demonstrated 30-50x speedup in feature analysis computation Demonstrated 10x speed up of route planning in OneSAF on a single CPU-GPU machine Three Phase GPU-Based Culling Procedure The number of segments is reduced by culling them against the full feature set The number of features is reduced by culling them against the reduced set of segments The reduced feature set is culled against each individual segment in the reduced segment set Participants Dinesh Manocha (UNC-CH) Troy Dere (RDECOM) Ming C. Lin (UNC-CH) Angel Rodriguez (RDECOM) Russel Gayle (UNC-CH) Marlo Verdesca (SAIC) David Knott (UNC-CH) LTC John Surdu (PEOSTRI) Maria Bauer (RDECOM) Jaeson Munro (SAIC) Eric Root (SAIC)