Finding feasible mold parting directions using graphics hardware

We present new programmable graphics hardware accelerated algorithms to test the 2-moldability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts as well as minimum and insufficient draft angles. Their running times grow only linearly with respect to the number of facets in the solid model, making them efficient subroutines for our algorithms that test whether a tessellated CAD model can be manufactured in a two-part mold. We have developed and implemented two such algorithms to choose candidate directions to test for 2-moldability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in the fact that they identify groups of candidate directions such that if any one direction in the group is undercut-free, all are, or if any one is not undercut-free, none are. We examine trade-offs between the algorithms' speed, accuracy, and whether they guarantee that an undercut-free direction will be found for a part if one exists.     

Accurate Depth of Field Simulation in Real Time

We present a new post processing method of simulating depth of field based on accurate calculations of circles of confusion. Compared to previous work, our method derives actual scene depth information directly from the existing depth buffer, requires no specialized rendering passes, and allows easy integration into existing rendering applications. Our implementation uses an adaptive, two‐pass filter, producing a high quality depth of field effect that can be executed entirely on the GPU, taking advantage of the parallelism of modern graphics cards and permitting real time performance when applied to large numbers of pixels.     

A note on circle packing

The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on commodity hardware. The speedups so achieved are discussed based on a number of experiments.     

自适应多采样扫描转换算法

随着片元着色器的可编程能力不断提高和新型图元的出现,扫描转换必须加强多采样时的处理能力.经典的边方程扫描转换算法便于实现多采样,但采样点测试的计算量大并且存在冗余测试,为此提出一种自适应多采样扫描转换算法.该算法的多采样集中在"边界片元",并结合点采样和区域采样技术根据自适应细分规则细分边界片元进行采样点的测试;避免了边方程算法中进行采样点测试时的乘法运算,减少了采样点的冗余测试,提高了多采样时扫描转换的性能.实验结果表明,文中算法在较小代价下达到或接近有相同采样点数的超采样反走样能力.     

火焰动画快速模拟的新方法

针对火焰动画难以快速建模和绘制的问题,提出了完全利用GPU过程化生成火焰动画的高效算法。先用建模工具在预处理阶段构建一个由平面正方形组成的三维模型,在绘制阶段通过GPU编程对这些方形进行Billboard方式的变换,并用一些简单公式对他们的运动方式、大小和颜色来用过程化方式进行控制,最后通过alpha混合得到最终结果。算法完全在GPU里实现,能满足实时的绘制要求。     

“天河一号”大规模科学与工程计算应用

安装在国家超级计算天津中心(以下简称天津超算中心)的"天河一号"超级计算机系统是目前世界上最快的超级计算机,已广泛应用于多个高性能计算领域,并取得了一系列具有国际影响力的应用成果。本文主要介绍了"天河一号"在石油勘探数据处理、生物信息与生物医药、环境科学、工程仿真、磁约束聚变领域的最新应用成果,其成果表明"天河一号"在上述领域具有良好的可扩展性和并行效率,对自主科技创新和产业技术提升给予了巨大支撑。     

基于CUDA编程模型的稀疏对角矩阵向量乘优化

稀疏矩阵向量乘是很多科学计算问题中的核心问题。本文针对稀疏对角矩阵,在DIA存储格式的基础上,设计了一种新型压缩存储格式CDIA,结合CUDA编程模型的特点,在计算线程上进行了细粒度的任务分配,同时为满足CUDA对存储器的合并访问要求,将压缩矩阵做了相应的转置处理,设计了细粒度算法与程序,并根据稀疏矩阵向量乘特点,做了相应的程序优化。实验数据显示,这种存储格式能够很好地发挥CUDA在数据处理方面的优势,在测试数据中,最高获得了单精度39.6Gflop/s和双精度19.6Gflop/s的浮点计算性能,性能在Nathan Bell和Michael Garland的基础上分别提高了7.6%和17.4%。     

Particle-in-Cell algorithms for emerging computer architectures

We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no data collisions, using CUDA C and Fortran. Speedups up to about 50 compared to a single core of the Intel i7 processor have been achieved. There was also an implementation for traditional multi-core processors using OpenMP which achieved high parallel efficiency. We believe that this approach should work for other emerging designs such as Intel Phi coprocessor from the Intel MIC architecture.     

CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm: 2D and 3D Ising,Potts, and XY models

We present sample CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q$q$-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.     

GPU accelerated online multi-particle beam dynamics simulator for ion linear particle accelerators

An online beam dynamics simulator is being developed for use in the operation of an ion linear particle accelerator. By employing Graphics Processing Unit (GPU) technology, the performance of the simulator has been significantly increased over that of a single CPU and is therefore viable in the demanding accelerator operations environment. Once connected to the accelerator control system, it can rapidly respond to any control set point changes and predict beam properties along an ion linear accelerator in pseudo-real time. This simulator will be a virtual beam diagnostic tool which is especially useful when direct beam measurements are not available. Details about the code structure design, physics algorithms, GPU implementations, and performance are presented.