The most popular hardware used for parallel depth migration is the PC-Cluster but its application is limited due to large space occupation and high power consumption. In this paper, we introduce a new hardware archite...The most popular hardware used for parallel depth migration is the PC-Cluster but its application is limited due to large space occupation and high power consumption. In this paper, we introduce a new hardware architecture, based on which the finite difference （FD） wavefield-continuation depth migration can be conducted using the Graphics Processing Unit （GPU） as a CPU coprocessor. We demonstrate the program module and three key optimization steps for implementing FD depth migration： memory, thread structure, and instruction optimizations and consider evaluation methods for the amount of optimization. 2D and 3D models are used to test depth migration on the GPU. The tested results show that the depth migration computational efficiency greatly increased using the general-purpose GPU, increasing by at least 25 times compared to the AMD 2.5 GHz CPU.展开更多
Particle-in-cell (PIC) method has got much benefits from GPU-accelerated heterogeneous systems.However,the performance of PIC is constrained by the interpolation operations in the weighting process on GPU (graphic pro...Particle-in-cell (PIC) method has got much benefits from GPU-accelerated heterogeneous systems.However,the performance of PIC is constrained by the interpolation operations in the weighting process on GPU (graphic processing unit).Aiming at this problem,a fast weighting method for PIC simulation on GPU-accelerated systems was proposed to avoid the atomic memory operations during the weighting process.The method was implemented by taking advantage of GPU's thread synchronization mechanism and dividing the problem space properly.Moreover,software managed shared memory on the GPU was employed to buffer the intermediate data.The experimental results show that the method achieves speedups up to 3.5 times compared to previous works,and runs 20.08 times faster on one NVIDIA Tesla M2090 GPU compared to a single core of Intel Xeon X5670 CPU.展开更多
In this note, we reported some results of homeomorphic classification of graphlikemanifolds of which contractions are edges of pyramids, and the number of vertexes of thebase of a pyramid, equal to 6 or 7 or 8.
The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, wher...The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, where a new term associating with the current measurement information(CMI) was introduced into the expression of the sampled particles. Through the repeated use of the least squares estimate, the CMI can be integrated into the sampling stage in an iterative manner, conducing to the greatly improved sampling quality. By running the IIDF, an iterated PF(IPF) can be obtained. Subsequently, a parallel resampling(PR) was proposed for the purpose of parallel implementation of IPF, whose main idea was the same as systematic resampling(SR) but performed differently. The PR directly used the integral part of the product of the particle weight and particle number as the number of times that a particle was replicated, and it simultaneously eliminated the particles with the smallest weights, which are the two key differences from the SR. The detailed implementation procedures on the graphics processing unit of IPF based on the PR were presented at last. The performance of the IPF, PR and their parallel implementations are illustrated via one-dimensional numerical simulation and practical application of passive radar target tracking.展开更多
The method to measure the refractive index of the liquid-state metal is introduced. By inserting a wedge sample cell to the optical path of the Michelson interferometer, the refractive index of the liquid-state alloy ...The method to measure the refractive index of the liquid-state metal is introduced. By inserting a wedge sample cell to the optical path of the Michelson interferometer, the refractive index of the liquid-state alloy SCN-Eth is measured at different temperatures and densities. The results show that this method can be applied to measure the refractive index of various liquids, especially at different temperatures.展开更多
This paper deals with a problem of application generation together with their Graphic User Interface （GUI）. Particularly, the source code generator based on dynamic frames was improved for more effective specificati...This paper deals with a problem of application generation together with their Graphic User Interface （GUI）. Particularly, the source code generator based on dynamic frames was improved for more effective specification of GUI. It＇s too demanding for the developers to have specification of the application that contain all physical coordinates and other details of buttons and other GUI elements. The developed solution for this problem is based on post-processing of generated source code using iterators for specifying coordinates and other values of graphic elements. The paper includes two examples of generating web applications and their GUI.展开更多
This paper presents an optimization of shadow volume algorithm, which allow a rendering in real-time. This technique is based on previous works which makes it possible to obtain shadows in real-time, although the calc...This paper presents an optimization of shadow volume algorithm, which allow a rendering in real-time. This technique is based on previous works which makes it possible to obtain shadows in real-time, although the calculation of the silhouette requires a pretreatment of the geometry implemented on the CPU （Central Processing Unit）. By using last version of the GPU （Graphic Processing Unit）, the authors propose to implement the calculation of the silhouette on the GPU by using Geometry Shader. The authors present the step which made it possible to lead to a concrete implementation of this algorithm, the modifications which were made, as well as a comparative study of results, followed by a discussion of these results and choices of implementation.展开更多
Mutual information （MI）-based image registration is effective in registering medical images, but it is computationally expensive. This paper accelerates MI-based image registration by dividing computation of mutual ...Mutual information （MI）-based image registration is effective in registering medical images, but it is computationally expensive. This paper accelerates MI-based image registration by dividing computation of mutual information into spatial transformation and histogram-based calculation, and performing 3D spatial transformation and trilinear interpolation on graphic processing unit （GPU）. The 3D floating image is downloaded to GPU as flat 3D texture, and then fetched and interpolated for each new voxel location in fragment shader. The transformed resuits are rendered to textures by using frame buffer object （FBO） extension, and then read to the main memory used for the remaining computation on CPU. Experimental results show that GPU-accelerated method can achieve speedup about an order of magnitude with better registration result compared with the software implementation on a single-core CPU.展开更多
The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algor...The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algorithm; and some ideas about GPUs （Graphics Processing Units） and its use in general purpose computing were presented. The paper shows a computational implementation of FDK algorithm and the process of parallelization of this implementation. Compare the parallel version of the algorithm with the sequential version, used speedup as a performance metric. To evaluate the performance of parallel version, two GPUs, GeForce 9400GT （16 cores） a low capacity GPU and Quadro 2000 （192 cores） a medium capacity GPU was reached speedup of 3.37.展开更多
基金supported by the National Natural Science Foundation of China (Nos. 41104083 and 40804024) Fundamental Research Funds for the Central Universities (No, 2011YYL022)
文摘The most popular hardware used for parallel depth migration is the PC-Cluster but its application is limited due to large space occupation and high power consumption. In this paper, we introduce a new hardware architecture, based on which the finite difference （FD） wavefield-continuation depth migration can be conducted using the Graphics Processing Unit （GPU） as a CPU coprocessor. We demonstrate the program module and three key optimization steps for implementing FD depth migration： memory, thread structure, and instruction optimizations and consider evaluation methods for the amount of optimization. 2D and 3D models are used to test depth migration on the GPU. The tested results show that the depth migration computational efficiency greatly increased using the general-purpose GPU, increasing by at least 25 times compared to the AMD 2.5 GHz CPU.
基金Projects(61170049,60903044)supported by National Natural Science Foundation of ChinaProject(2012AA010903)supported by National High Technology Research and Development Program of China
文摘Particle-in-cell (PIC) method has got much benefits from GPU-accelerated heterogeneous systems.However,the performance of PIC is constrained by the interpolation operations in the weighting process on GPU (graphic processing unit).Aiming at this problem,a fast weighting method for PIC simulation on GPU-accelerated systems was proposed to avoid the atomic memory operations during the weighting process.The method was implemented by taking advantage of GPU's thread synchronization mechanism and dividing the problem space properly.Moreover,software managed shared memory on the GPU was employed to buffer the intermediate data.The experimental results show that the method achieves speedups up to 3.5 times compared to previous works,and runs 20.08 times faster on one NVIDIA Tesla M2090 GPU compared to a single core of Intel Xeon X5670 CPU.
基金Supported by the State Ethnic Affairs Commission of PRC in 2000 year
文摘In this note, we reported some results of homeomorphic classification of graphlikemanifolds of which contractions are edges of pyramids, and the number of vertexes of thebase of a pyramid, equal to 6 or 7 or 8.
基金Project(61372136) supported by the National Natural Science Foundation of China
文摘The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, where a new term associating with the current measurement information(CMI) was introduced into the expression of the sampled particles. Through the repeated use of the least squares estimate, the CMI can be integrated into the sampling stage in an iterative manner, conducing to the greatly improved sampling quality. By running the IIDF, an iterated PF(IPF) can be obtained. Subsequently, a parallel resampling(PR) was proposed for the purpose of parallel implementation of IPF, whose main idea was the same as systematic resampling(SR) but performed differently. The PR directly used the integral part of the product of the particle weight and particle number as the number of times that a particle was replicated, and it simultaneously eliminated the particles with the smallest weights, which are the two key differences from the SR. The detailed implementation procedures on the graphics processing unit of IPF based on the PR were presented at last. The performance of the IPF, PR and their parallel implementations are illustrated via one-dimensional numerical simulation and practical application of passive radar target tracking.
文摘The method to measure the refractive index of the liquid-state metal is introduced. By inserting a wedge sample cell to the optical path of the Michelson interferometer, the refractive index of the liquid-state alloy SCN-Eth is measured at different temperatures and densities. The results show that this method can be applied to measure the refractive index of various liquids, especially at different temperatures.
文摘This paper deals with a problem of application generation together with their Graphic User Interface （GUI）. Particularly, the source code generator based on dynamic frames was improved for more effective specification of GUI. It＇s too demanding for the developers to have specification of the application that contain all physical coordinates and other details of buttons and other GUI elements. The developed solution for this problem is based on post-processing of generated source code using iterators for specifying coordinates and other values of graphic elements. The paper includes two examples of generating web applications and their GUI.
文摘This paper presents an optimization of shadow volume algorithm, which allow a rendering in real-time. This technique is based on previous works which makes it possible to obtain shadows in real-time, although the calculation of the silhouette requires a pretreatment of the geometry implemented on the CPU （Central Processing Unit）. By using last version of the GPU （Graphic Processing Unit）, the authors propose to implement the calculation of the silhouette on the GPU by using Geometry Shader. The authors present the step which made it possible to lead to a concrete implementation of this algorithm, the modifications which were made, as well as a comparative study of results, followed by a discussion of these results and choices of implementation.
基金Supported by National High Technology Research and Development Program("863"Program)of China(No.863-306-ZD13-03-06)
文摘Mutual information （MI）-based image registration is effective in registering medical images, but it is computationally expensive. This paper accelerates MI-based image registration by dividing computation of mutual information into spatial transformation and histogram-based calculation, and performing 3D spatial transformation and trilinear interpolation on graphic processing unit （GPU）. The 3D floating image is downloaded to GPU as flat 3D texture, and then fetched and interpolated for each new voxel location in fragment shader. The transformed resuits are rendered to textures by using frame buffer object （FBO） extension, and then read to the main memory used for the remaining computation on CPU. Experimental results show that GPU-accelerated method can achieve speedup about an order of magnitude with better registration result compared with the software implementation on a single-core CPU.
文摘The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algorithm; and some ideas about GPUs （Graphics Processing Units） and its use in general purpose computing were presented. The paper shows a computational implementation of FDK algorithm and the process of parallelization of this implementation. Compare the parallel version of the algorithm with the sequential version, used speedup as a performance metric. To evaluate the performance of parallel version, two GPUs, GeForce 9400GT （16 cores） a low capacity GPU and Quadro 2000 （192 cores） a medium capacity GPU was reached speedup of 3.37.
