A Parallel Halfsweep Multigrid Algorithm on the Shared Memory Multiprocessors

Main Article Content

Mohamed Othman
J. Sulaiman
A. R. Abdullah

Abstract

The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, is known as a fast multigrid poisson solver. In this paper, the implementation of the parallel halfsweep multigrid algorithm with several parallel strategies is discussed. The experiments were carried out on the shared memory multiprocessors computer system, Sequent S27, and the results of the test problem are included.

Downloads

Download data is not yet available.

Article Details

How to Cite
Othman, M., Sulaiman, J., & Abdullah, A. R. (2000). A Parallel Halfsweep Multigrid Algorithm on the Shared Memory Multiprocessors. Malaysian Journal of Computer Science, 13(2), 1–6. Retrieved from https://mjcs.um.edu.my/index.php/MJCS/article/view/5836
Section
Articles