A Parallel Halfsweep Multigrid Algorithm on the Shared Memory Multiprocessors

Authors

  • Mohamed Othman Department of Communication Technology and Networks, Universiti Putra Malaysia
  • J. Sulaiman School of Science and Technology, Universiti Malaysia Sabah
  • A. R. Abdullah Department of Industrial Computing, Universiti Kebangsaan Malaysia

Keywords:

Parallel halfsweep multigrid algorithm, Parallel strategy, Performance evaluation

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.

Downloads

Published

2000-12-01

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://adab.um.edu.my/index.php/MJCS/article/view/5836

Issue

Vol. 13 No. 2 (2000): Malaysian Journal of Computer Science

Section

Articles