Parallel Implementation of 2-D Telegraphic Equation on MPI/PVM Cluster

Ewedafe, SU; Shariffudin, RH (2011) Parallel Implementation of 2-D Telegraphic Equation on MPI/PVM Cluster. International Journal of Parallel Programming, 39 (2). pp. 202-231. ISSN 0885-7458

Full text not available from this repository.

Abstract

In this paper, a parallel implementation of the Iterative Alternating Direction Explicit method by D'Yakonov (IADE-DY) to solve 2-D 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 5-10%. 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:
  1. Ewedafe, SU
  2. Shariffudin, RH(University of Malaya)
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: 26 Aug 2011 15:29
URI: http://eprints.um.edu.my/id/eprint/2070

Actions (For repository staff only: Login required)

View Item