Abstract
We suggest in this paper a parallel implementation of cellular automation and global random walk algorithms for solving drift–diffusion–recombination problems which in contrast to the classical random walk on spheres (RWS) methods calculate the solution in any desired family of m prescribed points. The method uses only N trajectories in contrast to mN trajectories in the conventional RWS algorithm. The idea is based on the adjoint symmetry property of the Green function and a double randomization approach. The synchronous multi-particle cellular automaton model of drift–diffusion–recombination is based on known cellular automata. The global RWS and cellular automaton models are tested against the exact solutions of the equation. The accuracy and computer time of both algorithms is analyzed. Parallel codes for the Monte Carlo and cellular automaton algorithms are implemented. The domain decomposition method is employed for the cellular automaton parallel implementation. The global random walk algorithm is parallelized by the Monte Carlo trajectories distribution among the cluster cores. The efficiency of the parallel codes is studied.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
