M., Othman and A. R., Abdullah (2000) An Efficient Parallel Quarter-sweep Point Iterative Algorithm for Solving Poisson Equation on SMP Parallel Computer. Pertanika Journal of Science & Technology, 8 (2). pp. 161-174. ISSN 0128-7680
A new point iterative algorithm which uses the quarter-sweep approach was shown to be much faster than the full-and half- sweep point iterative algorithms for solving two dimensional Poison equation (Othman el at. 1998». However, the last two algorithms were found to be suitable for parallel implementation (Evans 1984) and Ali el at. (1997». In this paper, the parallel implementation of the new algorithm with the chessboard (CB) strategy on Symmetry Multi Processors (SMP) parallel computer was presented. The experimental results of a test problem were compared with the later two parallel algorithms.
|Keyword:||Poisson equation, Parallel algorithms, Chessboard strategy, Full-, half- and quarter-sweep approaches, Performance evaluation|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Publisher:||Universiti Putra Malaysia Press|
|Deposited By:||Nur Izzati Mohd Zaki|
|Deposited On:||30 Nov 2009 00:40|
|Last Modified:||27 May 2013 07:09|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 30 Nov 2009 00:40.