Point Distribution Tensor Computation on Heterogeneous Systems

Abstract Big data in observational and computational sciences impose increasing challenges on data analysis. In particular, data from light detection and ranging (LIDAR) measurements are questioning conventional methods of CPU-based algorithms due to their sheer size and complexity as needed for decent accuracy. These data describing terrains are natively given as big point clouds consisting of millions of independent coordinate locations from which meaningful geometrical information content needs to be extracted. The method of computing the point distribution tensor is a very promising approach, yielding good results to classify domains in a point cloud according to local neighborhood information. However, an existing KD-Tree parallel approach, provided by the VISH visualization framework, may very well take several days to deliver meaningful results on a real-world dataset. Here we present an optimized version based on uniform grids implemented in OpenCL that is able to deliver results of equal accuracy up to 24 times faster on the same hardware. The OpenCL version is also able to benefit from a heterogeneous environment and we analyzed and compared the performance on various CPU, GPU and accelerator hardware platforms. Finally, aware of the heterogeneous computing trend, we propose two low-complexity dynamic heuristics for the scheduling of independent dataset fragments in multi-device heterogenous systems.

[1]  Thomas Fahringer,et al.  LibWater: heterogeneous distributed computing made easy , 2013, ICS '13.

[2]  Simon Green,et al.  Particle Simulation using CUDA , 2010 .

[3]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[4]  M. S. Warren,et al.  A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[5]  Zhongzhi Shi,et al.  A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems , 2007, J. Parallel Distributed Comput..

[6]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[7]  W. Benger,et al.  Visualization Methods for Numerical Astrophysics , 2012 .

[8]  Thomas Fahringer,et al.  An automatic input-sensitive approach for heterogeneous task partitioning , 2013, ICS '13.

[9]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[10]  Vittorio Scarano,et al.  An Efficient GPU Implementation for Large Scale Individual-Based Simulation of Collective Behavior , 2009, 2009 International Workshop on High Performance Computational Systems Biology.

[11]  Sudip K. Seal,et al.  Efficient simulation of agent-based models on multi-GPU and multi-core clusters , 2010, SimuTools.

[12]  Werner Benger,et al.  Visualization of General Relativistic Tensor Fields via a Fiber Bundle Data Model , 2004 .

[13]  Miguel Lozano,et al.  Accelerating collision detection for large-scale crowd simulation on multi-core and many-core architectures , 2014, Int. J. High Perform. Comput. Appl..

[14]  Werner Benger,et al.  The Concepts of VISH , 2007 .

[15]  Werner Benger,et al.  Reconstructing Power Cables From LIDAR Data Using Eigenvector Streamlines of the Point Distribution Tensor Field , 2012, J. WSCG.

[16]  Sanjeev Baskiyar,et al.  A general distributed scalable grid scheduler for independent tasks , 2009, J. Parallel Distributed Comput..

[17]  Michael S. Warren,et al.  Astrophysical N-body simulations using hierarchical tree data structures , 1992, Proceedings Supercomputing '92.

[18]  Thomas Fahringer,et al.  A uniform approach for programming distributed heterogeneous computing systems , 2014, J. Parallel Distributed Comput..

[19]  K. A. Hawick,et al.  Spatial Data Structures, Sorting and GPU Parallelism for Situated-agent Simulation and Visualisation , 2012 .

[20]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[21]  Daniel G. Aliaga,et al.  A Survey of Urban Reconstruction , 2013, Comput. Graph. Forum.

[22]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..