Abstract

This paper deals with a system of nonlinear differential equations, which describe the interaction of two focused laser beams in nonlinear media. The system of equations is approximated by a splitting finite difference scheme. A parallel version of the finite‐difference scheme is proposed and the efficiency of this algorithm is investigated. Calculations are performed using clusters of computers, connected via local computer network. The emphasis is made on solving this problem on heterogeneous clusters. In the paper a static distribution scheme is analyzed. The results of several computational experiments are presented. Data redistribution during an initial phase of computation is investigated and the influence of slow communication among the processes is taken into account during this analysis.

Highlights

  • We consider the problem of two counteracting focused laser beams in non{ linear media

  • This paper deals with a system of nonlinear di erential equations, which describe the interaction of two focused laser beams in nonlinear media

  • The system of equations is approximated by a splitting nite di erence scheme

Read more

Summary

INTRODUCTION

We consider the problem of two counteracting focused laser beams in non{ linear media. It is described by the system of nonlinear equations in Q =. Z, t , r are non-dimensional coordinates, of the wave vectors, ;L, ;S, ; are the coe LS = cients o2kfL 1nSon,linkLeaSr counter-action, L S are laser and Stokes wave absorption coe cients, L S are the nonlinear refraction indexes. Boundary conditions are de ned on the edge of the region Q: eL (0 r t) = e1L (r t) eS (L r t) = e1S (r t). 0: The initial conditions are given at t=0: eL (z r 0) = e0L (z r) eS (z r 0) = e0S (z r).

De nition of the discrete grid
PARALLEL IMPLEMENTATION OF THE ALGORITHM
Performance of the parallel code
Distributed remapping problem
Static task distribution
CONCLUSIONS
Full Text
Published version (Free)

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 call