Wednesday, 01 Apr, 2020

011-28082485

011-47044510

+91-9899775880

An Optimisation Approach for Construction of a Distributed Minimum Spanning Tree (DMST) Using MPI

International Journal of System and Software Engineering

Volume 3 Issue 2

Published: 2015
Author(s) Name: Md. Akkas Ali | Author(s) Affiliation: Lecturer, Department of CSE, Pabna University of Science and Technology, Pabna, Bangladesh
Locked Subscribed Available for All

Abstract

The present paper determines Distributed Minimum Spanning Tree (DMST) of very large graphs. It is very time consuming to calculate in a single machine. So the researcher has used parallel programming. One of the DMST algorithms that support parallel computing is Boruvkas algorithm. The researcher has used this algorithm. To avail the parallelism, we have used the MPI architecture.

Keywords: Distributed Minimum Spanning Tree (DMST), Message Passing Interface (MPI), Parallelism, Boruvkas Algorithm

View PDF

Refund policy | Privacy policy | Copyright Information | Contact Us | Feedback © Publishingindia.com, All rights reserved