On the Parallel Design and Analysis for 3-D ADI Telegraph Problem with MPI
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 4
Abstract
In this paper we describe the 3-D Telegraph Equation (3-DTEL) with the use of Alternating Direction Implicit (ADI) method on Geranium Cadcam Cluster (GCC) with Message Passing Interface (MPI) parallel software. The algorithm is presented by the use of Single Program Multiple Data (SPMD) technique. The implementation is discussed by means of Parallel Design and Analysis with the use of Domain Decomposition (DD) strategy. The 3-DTEL with ADI scheme is implemented on the GCC cluster, with an objective to evaluate the overhead it introduces, with ability to exploit the inherent parallelism of the computation. Results of the parallel experiments are presented. The Speedup and Efficiency from the experiments on different block sizes agree with the theoretical analysis.
Authors and Affiliations
Simon Uzezi Ewedafe, Rio Shariffudin
A Heterogeneous Framework to Detect Intruder Attacks in Wireless Sensor Networks
Wireless sensor network (WSN) has been broadly implemented in real world applications, such as monitoring of forest fire, military targets detection, medical and/or science areas and above all in our daily home life as w...
Computation of Single Beam Echo Sounder Signal for Underwater Objects Detection and Quantification
Underwater Acoustic methods have been extensively used to locate and identify marine objects. These applications include locating underwater vehicles, finding shipwrecks, imaging sediments and imaging bubble fields. Ocea...
Interaction between Learning Style and Gender in Mixed Learning with 40% Face-to-face Learning and 60% Online Learning
Student learning styles are important factors that have a strong impact on student performance in learning outcomes. That is why each learning method will produce different learning outcomes for students who have differe...
Effective Performance of Information Retrieval by using Domain Based Crawler
World Wide Web continuously introduces new capabilities and attracts many people[1]. It consists of more than 60 billion pages online. Due to this explosion in size, the information retrieval system or Search Engines are...
A Memetic Algorithm for the Capacitated Location-Routing Problem
In this paper, a hybrid genetic algorithm is proposed to solve a Capacitated Location-Routing Problem. The objective is to minimize the total cost of the distribution in a network composed of depots and customers, both d...