共查询到7条相似文献,搜索用时 0 毫秒
1.
Damjan Strnad 《Concurrency and Computation》2011,23(18):2452-2462
In this paper, we present the graphics processing unit (GPU)‐based parallel implementation of visibility calculation from multiple viewpoints on raster terrain grids. Two levels of parallelism are introduced in the GPU kernels — parallel traversal of visibility rays from a single viewpoint and parallel processing of viewpoints. The obtained visibility maps are combined in parallel using the selected logical operator. A comparison with multi‐threaded CPU implementation is performed to establish the expected speed‐ups of viewshed construction when the source and destination types are sets of scattered locations, paths, or regions. The results demonstrate that using the GPU, the acceleration of an order of magnitude can be achieved on average with both point sampling and bilinear filtering of the elevation map. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
2.
MCM-41中混合势模型及简单流体吸附的巨正则Monte Carlo模拟 总被引:1,自引:1,他引:0
提出了一个混合势模型,利用巨正则系综蒙特卡罗方法分别研究了氮气、甲烷及乙烷在MCM-41中的吸附等温线。该混合势模型采用我们最近提出的完全解析的势模型描述孔壁中氧原子对MCM-41中流体分子的作用,采用Tjatjopoulos等提出的势模型近似表征MCM-41表面硅醇基团和一些未知因素对流体分子的作用。计算结果表明,混合势模型吸收了被混合的两个势模型的优点,较单独使用一个模型计算精度具有较大改进,能更好地表征中孔分子筛MCM-41。 相似文献
3.
One of the most efficient non-perturbative methods for the calculation of thermal properties of quantum systems is the Hybrid Monte Carlo algorithm, as evidenced by its use in large-scale lattice quantum chromodynamics calculations. The performance of this algorithm is determined by the speed at which the fermion operator is applied to a given vector, as it is the central operation in the preconditioned conjugate gradient iteration. We study a simple implementation of these operations for the fermion matrix of the Hubbard model in d+1 spacetime dimensions, and report a performance comparison between a 2.66 GHz Intel Xeon E5430 CPU and an NVIDIA Tesla C1060 GPU using double-precision arithmetic. We find speedup factors ranging between 30 and 350 for d=1, and in excess of 40 for d=3. We argue that such speedups are of considerable impact for large-scale simulational studies of quantum many-body systems. 相似文献
4.
5.
针对现有视频二值分割算法分割性能过低的问题,提出了一种基于GPU的视频实时二值概率分割算法.该算法通过规范化视频帧中每个像素属于前景类和背景类的概率大小,实现了基于二次马尔可夫测量场(QMMF)模型的视频实时二值概率分割.首先分别为不同场景的视频帧提出了两种概率模型,即静态背景概率模型(SBLM)和动态背景概率模型(UBLM);然后,通过光照矫正算法颜色转换、阴影抑制算法阴影检测以及伪装检测算法来计算每个像素属于背景类的概率值;最后,通过Gauss-Seidel模型迭代计算出了使能量函数取得最小值的背景概率值进而得到像素的二值化值.此外,为了提高算法分割的准确性,该算法包含了对光照突变、投射阴影以及伪装情况的实时处理.同时,为了满足算法的实时性要求,在NVIDIA GPU上并行实现了该算法.验证了所提算法的分割性能即算法分割的正确性,测试了算法的GPU执行时间.实验结果表明,在算法分割完整性方面ViBe+和GMM+的平均漏检率和平均误检率分别是QMMF的3倍和6倍;在算法执行时间方面ViBe+和GMM+的平均GPU执行时间大约是QMMF的1.3倍.此外,还计算了QMMF算法的GPU加速比约为76.8. 相似文献
6.
Membrane systems are parallel distributed computing models that are used in a wide variety of areas. Use of a sequential machine to simulate membrane systems loses the advantage of parallelism in Membrane Computing. In this paper, an innovative classification algorithm based on a weighted network is introduced. Two new algorithms have been proposed for simulating membrane systems models on a Graphics Processing Unit (GPU). Communication and synchronization between threads and thread blocks in a GPU are time-consuming processes. In previous studies, dependent objects were assigned to different threads. This increases the need for communication between threads, and as a result, performance decreases. In previous studies, dependent membranes have also been assigned to different thread blocks, requiring inter-block communications and decreasing performance. The speedup of the proposed algorithm on a GPU that classifies dependent objects using a sequential approach, for example with 512 objects per membrane, was 82×, while for the previous approach (Algorithm 1), it was 8.2×. For a membrane system with high dependency among membranes, the speedup of the second proposed algorithm (Algorithm 3) was 12×, while for the previous approach (Algorithm 1) and the first proposed algorithm (Algorithm 2) that assign each membrane to one thread block, it was 1.8×. 相似文献
7.
Karl-Heinz Zimmermann 《Computer Physics Communications》2005,165(3):243-259
Combinatorial optimization problems are usually NP-hard. These problems are generally tackled by heuristic or branch-and-bound methods. The aim of this paper is to tackle constrained combinatorial optimization problems by importance Monte Carlo sampling. For this, we show that every constrained combinatorial optimization problem can be represented by a thermodynamical system in a suitable grand canonical ensemble given by the quantities of temperature, volume, and chemical potential. In order to find optimum solutions of the optimization problem, the grand canonical Monte Carlo method can be applied to the corresponding thermodynamical system. This method will amount to importance sampling, i.e. good feasible solutions of the optimization problem will be preferably sampled, provided that the intensive quantities of temperature and chemical potential are appropriately chosen. Our approach extends the standard importance sampling approach in the canonical ensemble to tackle unconstrained combinatorial optimization problems. The knapsack problem is considered as a prototype example. 相似文献