International Journal of System & Software Engineering

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

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


Affiliations
1 Department of CSE, Pabna University of Science and Technology, Pabna, Bangladesh
     

   Subscribe/Renew Journal


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 Boruvka's 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, Boruvka’s Algorithm.
Subscription Login to verify subscription
User
Notifications
Font Size



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

Abstract Views: 467  |  PDF Views: 0

Authors

Md. Akkas Ali
Department of CSE, Pabna University of Science and Technology, Pabna, Bangladesh

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 Boruvka's 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, Boruvka’s Algorithm.

References