Time parallel kinetic-molecular interaction algorithm for CPU/GPU computers

نویسنده

  • Sorin Mitran
چکیده

A parallel-in-time, multiscale interaction procedure is introduced for systems described at molecular scales by time-dependent random variables that obey Langevin dynamics. At larger, kinetic scales, the system is described by a probability distribution function that obeys an associated Fokker-Planck equation. It is assumed that the main quantity of interest is the kinetic-scale probability distribution function, and that molecular time scales are much smaller than those of interest at the kinetic scale. The overall multiscale interaction procedure is an iterative refinement predictorcorrector algorithm similar to the parareal method, but with different physical models used in each stage. In the predictor stage, a partial differential equation solver is used to obtain estimates of the probability distribution function on a subdivision of a time interval. At the starting time of each subinterval, the predicted probability distribution function is used to initialize an ensemble of random variables that are subsequently evolved forward in time by the Langevin dynamics. A probability distribution function estimate is constructed from the Langevin time evolution at the molecular scale and compared to that from the kinetic scale Fokker-Planck equation to determine whether further iterative refinement is needed. The molecular-scale computations are executed on highly parallel graphics processor units, while the kinetic-scale simulation is running on central processing units. The performance of the algorithm is tested on the simple dumbbell model of polymer flow.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Use of Graphics Processing Units (GPUs) for Molecular Dynamics Simulation of Spherical Particles

General-purpose computation on Graphics Processing Units (GPU) on personal computers has recently become an attractive alternative to parallel computing on clusters and supercomputers. We present the GPU-implementation of an accurate molecular dynamics algorithm for a system of spheres. The new hybrid CPU-GPU implementation takes into account all the degrees of freedom, including the quaternion...

متن کامل

Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)

Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...

متن کامل

Parallelized computation for computer simulation of electrocardiograms using personal computers with multi-core CPU and general-purpose GPU

Biological computations like electrocardiological modelling and simulation usually require high-performance computing environments. This paper introduces an implementation of parallel computation for computer simulation of electrocardiograms (ECGs) in a personal computer environment with an Intel CPU of Core (TM) 2 Quad Q6600 and a GPU of Geforce 8800GT, with software support by OpenMP and CUDA...

متن کامل

Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform

There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...

متن کامل

Selecting the Best Tridiagonal System Solver Projected on Multi-Core CPU and GPU Platforms

Nowadays multicore processors and graphics cards are commodity hardware that can be found in personal computers. Both CPU and GPU are capable of performing high-end computations. In this paper we present and compare parallel implementations of two tridiagonal system solvers. We analyze the cyclic reduction method, as an example of fine-grained parallelism, and Bondeli’s algorithm, as a coarse-g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010