Numerical methods and programming
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Num. Meth. Prog.: Year: Volume: Issue: Page: Find

 Num. Meth. Prog., 2008, Volume 9, Issue 3, Pages 305–310 (Mi vmp441)

Âû÷èñëèòåëüíûå ìåòîäû è ïðèëîæåíèÿ

Numerical performance of a sweep parallel algorithm on distributed memory multiprocessors

V. E. Vitkovskiy, M. P. Fedoruk

Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: An efficient sweep parallel algorithm used when solving the nonlinear Schrödinger equation by the implicit Crank-Nicolson scheme with a spatial and time mesh refinement mechanism is considered. Its performance on distributed-memory multiprocessors is analyzed. It is shown on the basis of computational experiments and the well-known theoretical model (Amdahl's law) that the proposed algorithm scales well and achieves efficiency and speedup over the sequential algorithm up to $0.7$ and $30$, respectively. The effect of the numerical mesh size (range, $10^4 - 10^6$) and the network communication delays (CPU number range, $6$$128$) on the performance of computing is discussed.

Keywords: mathematical simulation, parallel algorithms, high performance computing, Schroedinger equation.

Full text: PDF file (446 kB)
UDC: 519.688

Citation: V. E. Vitkovskiy, M. P. Fedoruk, “Numerical performance of a sweep parallel algorithm on distributed memory multiprocessors”, Num. Meth. Prog., 9:3 (2008), 305–310

Citation in format AMSBIB
\Bibitem{VitFed08} \by V.~E.~Vitkovskiy, M.~P.~Fedoruk \paper Numerical performance of a sweep parallel algorithm on distributed memory multiprocessors \jour Num. Meth. Prog. \yr 2008 \vol 9 \issue 3 \pages 305--310 \mathnet{http://mi.mathnet.ru/vmp441}