Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

A Parallel Halfsweep Multigrid Algorithm on the Shared Memory Multiprocessors

Othman Mohamed, and Sulaiman, J. and Abdul Rahman Abdullah, (2000) A Parallel Halfsweep Multigrid Algorithm on the Shared Memory Multiprocessors. Malaysian Journal of Computer Science, 13 (2). pp. 1-6. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=97

Affiliations

Universiti Putra Malaysia
Universiti Malaysia Sabah
Universiti Kebangsaan Malaysia

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.

Item Type:Journal
Keywords:Parallel halfsweep multigrid algorithm; Parallel strategy; Performance evaluation
Subjects:Q Science
ID Code:226

T.F. Chan and Y. Saad. “Multigrid Algorithms on the Hypercube Multiprocessor”. IEEE Transaction on Computer, Vol. C-35, No. 11, 1986, pp. 969-977.

S.N. Gupta, M. Zubair and C.E. Grösch. “A Multigrid Algorithm for Parallel Computer: CPMG”. Journal of Scientific Computing, Vol. 7, 1992, pp. 263-279.

O. A. McBryan et al. “Multigrid Methods on Parallel Computers - A Survey on Recent Developments”, Impact of Computing in Science and Engineering, Vol. 3, 1991, pp. 1-75.

L.R. Matheson and R.E. Tarjan. “Parallelism in Multigrid Methods: How Much is Too Much?”. International Journal of Parallel Programming, Vol. 24, No. 5, 1996, pp. 387-432.

M. Othman and A.R. Abdullah. “The Halfsweeps Multigrid Method as a Fast Multigrid Poisson Solver”. International Journal of Computers and Mathematics, Vol. 69, 1998, pp. 319-329.

K. Sölchenbach, C.A. Thöle and U. Tröttenberg. “Parallel Multigrid Methods: Implementation of SUPRENUM-like Architectures and Applications”. INRIA Rapports de Recherche, N°. 746, 1987.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.