Ewedafe, S.U.; Shariffudin, R.H. (2011) Parallel Implementation of 2D Telegraphic Equation on MPI/PVM Cluster. International Journal of Parallel Programming, 39 (2). pp. 202231. ISSN 08857458
Full text not available from this repository.Abstract
In this paper, a parallel implementation of the Iterative Alternating Direction Explicit method by D'Yakonov (IADEDY) to solve 2D telegraphic problem on a distributed system using Message Passing Interface (MPI) and Parallel Virtue Machine (PVM) are presented. The parallelization of the program is implemented by a domain decomposition strategy. A Single Program Multiple Data (SPMD) model is employed for the implementation. The implementation is discussed in relation to means of the parallel performance strategies and analysis. The model enhances overlap communication and computation to avoid unnecessary synchronization, hence, the method yields significant speedup. The level of speedup observed from tables as the mesh increases are in the range of 510%. Improvement has been achieved by numbers of tables and figures in our experiment. We present some analyses that are helpful for speedup and efficiency. It is concluded that the efficiency is strongly dependent on the grid size, block numbers and the number of processors for both MPI and PVM. Different strategies to improve the computational efficiency are proposed.
Item Type:  Article 

Creators: 

Journal or Publication Title:  International Journal of Parallel Programming 
Uncontrolled Keywords:  Computer Science; Theory & Methods; 
Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science 
Divisions:  Faculty of Science > Institute of Mathematical Sciences 
Depositing User:  Zanaria Saupi Udin 
Date Deposited:  26 Aug 2011 15:29 
Last Modified:  21 Dec 2014 17:25 
URI:  http://eprints.um.edu.my/id/eprint/2070 
Actions (For repository staff only: Login required)
View Item 