Journal of Network and Information Security

2015 | Volume 3 | Issue 2

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

1. Md. Akkas Ali – Lecturer, Department Of Cse, Pabna University Of Science And Technology, Pabna, Bangladesh

Received
08-Feb-2016 		Accepted
- 		Published
08-Feb-2016
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
Locked
Subscribed
Open Access
Open Access
Articles Journal Info Editorial Board Guidelines Pricing Info Peer Review & Publication Policy Submit Manuscript