An Efficient Parallel Quarter-sweep Point Iterative Algorithm for Solving Poisson Equation on SMP Parallel Computer

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

[img] PDF
2893Kb

Abstract

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.

Item Type:Article
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
ID Code:3501
Deposited By: Nur Izzati Mohd Zaki
Deposited On:30 Nov 2009 00:40
Last Modified:27 May 2013 07:09

Repository Staff Only: item control page


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.