A high performance crashworthiness simulation system based on GPU

Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system.     

High-speed,two-dimensional digital image correlation algorithm using heterogeneous (CPU-GPU) framework

Two-dimensional digital image correlation (2D-DIC) is an experimental technique used to measure in-plane displacement of a test specimen. Real-time measurement of full-field displacement data is challenging due to enormous computational load of the algorithm. In order to improve the computational speed, the focus of recent research works has been on the approach of parallelization across subsets within image pairs using graphics processing unit (GPU). But alternate GPU-based parallelization approaches to improve the performance of this algorithm as per the order of data processing have not been explored. To address this research gap, our method utilizes parallelism within a subset as well as across subsets for each computation step in an iteration cycle. A heterogeneous (CPU-GPU) framework in combination with a pyramid-based initial values estimation for subsets (in parallel) is proposed in this work. The precompute steps of the proposed framework are implemented using CPU, whereas the main iterative steps are realized using GPU. It is demonstrated that the overall computational speed of the proposed heterogeneous framework improves by compared to a sequential CPU-based implementation for a pair of gray-scale images with a resolution of pixels. As an important milestone, feasibility to measure deformations in real time ( 1 s) is manifested in this study.     

Voronoi图栅格生成算法GPU并行实现

针对矢量法生成Voronoi图计算与存储复杂的缺点,重点分析研究了Voronoi图的栅格生成方法。对不同的栅格生成算法的复杂性和效率进行了比较分析,并针对以往方法速度较慢的问题,提出一种CUDA平台下GPU并行栅格扫描的方法。该方法利用GPU的多线程特性,将各个栅格的计算分散到不同的线程中并行处理。相比其他栅格生成方法,该方法不需要考虑栅格的规模,能够以几乎线性的时间完成Voronoi图的生成,极大地提高了生成速度。     

Mapping Cohesive Fracture and Fragmentation Simulations to Graphics Processor Units

A graphics processor units(GPU)‐based computational framework is presented to deal with dynamic failure events simulated by means of cohesive zone elements. The work is divided into two parts. In the first part, we deal with pre‐processing of the information and verify the effectiveness of dynamic insertion of cohesive elements in large meshes in parallel. To this effect, we employ a novel and simplified topological data structure specialized for meshes with triangles, designed to run efficiently and minimize memory occupancy on the GPU. In the second part, we present a parallel explicit dynamics code that implements an extrinsic cohesive zone formulation where the elements are inserted ‘on‐the‐fly’, when needed and where needed. The main challenge for implementing a GPU‐based computational framework using an extrinsic cohesive zone formulation resides on being able to dynamically adapt the mesh, in a consistent way, by inserting cohesive elements on fractured facets. In order to handle that, we extend the conventional data structure used in the finite element method (based on element incidence) and store, for each element, references to the adjacent elements. This additional information suffices to consistently insert cohesive elements by duplicating nodes when needed. Currently, our data structure is specialized for triangular meshes, but an extension to tetrahedral meshes is feasible. The data structure is effective when used in conjunction with algorithms to traverse nodes and elements. Results from parallel simulations show an increase in performance when adopting strategies such as distributing different jobs among threads for the same element and launching many threads per element. To avoid concurrency on accessing shared entities, we employ graph coloring. In a pre‐processing phase, each node of the dual graph (bulk elements of the mesh as graph nodes) is assigned a color different from the colors assigned to adjacent nodes. In that fashion, elements of the same color can be processed in parallel without concurrency. All the procedures needed for the insertion of cohesive elements along fracture facets and for computing nodal properties are performed by threads assigned to triangles, invoking one kernel per color. Computations on existing cohesive elements are also performed based on adjacent bulk elements. Experiments show that GPU speedup increases with the number of nodes and bulk elements. Copyright © 2015 John Wiley & Sons, Ltd.     

A novel GPU-accelerated strategy for contingency screening of static security analysis

Graphics processing unit (GPU) has been applied successfully in many computation and memory intensive realms due to its superior performances in float-pointing calculation, memory bandwidth and power consumption, and has great potential in power system applications. Contingency screening is a major time consuming part of contingency analysis. In the absence of relevant existing research, this paper is the first of its kind to propose a novel GPU-accelerated algorithm for direct current (DC) contingency screening. Adapting actively unique characteristics of GPU software and hardware, the proposed GPU algorithm is optimized from four aspects: data transmission, parallel task allocation, memory access, and CUDA (Compute Unified Device Architecture) stream. Case studies on a 3012-bus system and 8503-bus system have shown that the GPU-accelerated algorithm, in compared with its counterpart CPU implementation, can achieve about 20 and 50 times speedup respectively. This highly promising performance has demonstrated that carefully designed performance tuning in conjunction with GPU programing architecture is imperative for a GPU-accelerated algorithm. The presented performance tuning strategies can be applicable to other GPU applications in power systems.     

Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU

The Grover quantum search algorithm, one of only a few representative quantum algorithms, can speed up many classical algorithms that use search heuristics. No true quantum computer has yet been developed. For the present, simulation is one effective means of verifying the search algorithm. In this work, we focus on the simulation workflow using a compute unified device architecture (CUDA). Two simulation workflow schemes are proposed. These schemes combine the characteristics of the Grover algorithm and the parallelism of general-purpose computing on graphics processing units (GPGPU). We also analyzed the optimization of memory space and memory access from this perspective. We implemented four programs on CUDA to evaluate the performance of schemes and optimization. Through experimentation, we analyzed the organization of threads suited to Grover algorithm simulations, compared the storage costs of the four programs, and validated the effectiveness of optimization. Experimental results also showed that the distinguished program on CUDA outperformed the serial program of libquantum on a CPU with a speedup of up to 23 times (12 times on average), depending on the scale of the simulation.     

GPU-based simulation of the long-range Potts model via parallel tempering

We discuss the efficiency of parallelization on graphical processing units (GPUs) for the simulation of the one-dimensional Potts model with long-range interactions via parallel tempering. We investigate the behavior of some thermodynamic properties, such as equilibrium energy and magnetization, critical temperatures as well as the separation between the first- and second-order regimes. By implementing multispin coding techniques and an efficient parallelization of the interaction energy computation among threads, the GPU-accelerated approach reached speedup factors of up to 37.     

基于GPU的AES算法实现

近几年图形处理器GPU的通用计算能力发展迅速,现在已经发展成为具有巨大并行运算能力的多核处理器,而CUDA架构的推出突破了传统GPU开发方式的束缚,把GPU巨大的通用计算能力解放了出来.本文利用GPU来加速AES算法,即利用GPU作为CPU的协处理器,将AES算法在GPU上实现,以提高计算的吞吐量.最后在GPU和CPU...     

同态滤波的一种GPU提速实现方法

为了提高光照不均图像的增强速率,提出了基于GPU平台的同态滤波并行算法.根据同态滤波算法的并行性,利用CUDA软硬件体系架构,实现了同态滤波算法向GPU上的移植.利用多幅不同分辨率图像作为测试数据,对比CPU和GPU方案的计算效率.实验结果表明,GPU实现方案大幅度提升了计算效率.