A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms

In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sukkur IBA Journal of Computing and Mathematical Sciences (Online) Jg. 1; H. 1; S. 58 - 66
Hauptverfasser: Munier, Badri, Aleem, Muhammad, Islam, Muhammad Arshad, Iqbal, Muhammad Azhar, Mehmood, Waqar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Sukkur IBA University 30.06.2017
ISSN:2520-0755, 2522-3003
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the computing power of multi-core machines. Computer network routing, civil infrastructure planning and cluster analysis are typically use-cases of spanning tree problem. The experimental results show that the proposed algorithm is scalable for different machine and graph sizes. The methodology is simple and can easily be implemented using different shared-memory parallel programming models.
AbstractList In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the computing power of multi-core machines. Computer network routing, civil infrastructure planning and cluster analysis are typically use-cases of spanning tree problem. The experimental results show that the proposed algorithm is scalable for different machine and graph sizes. The methodology is simple and can easily be implemented using different shared-memory parallel programming models.
Author Munier, Badri
Aleem, Muhammad
Islam, Muhammad Arshad
Mehmood, Waqar
Iqbal, Muhammad Azhar
Author_xml – sequence: 1
  givenname: Badri
  surname: Munier
  fullname: Munier, Badri
– sequence: 2
  givenname: Muhammad
  surname: Aleem
  fullname: Aleem, Muhammad
– sequence: 3
  givenname: Muhammad Arshad
  surname: Islam
  fullname: Islam, Muhammad Arshad
– sequence: 4
  givenname: Muhammad Azhar
  surname: Iqbal
  fullname: Iqbal, Muhammad Azhar
– sequence: 5
  givenname: Waqar
  surname: Mehmood
  fullname: Mehmood, Waqar
BookMark eNo9kMtOAjEUhhuDiYgs3fcFBnuZS2c5IaJEiCaybzq9QHGmnbSDCTtfw9fzSYTBuDqXP_nOyXcLRs47DcA9RjOKMlo8xL1s4-wTWzxjV2BMMkISihAdDT1KUJFlN2Aao61RmhY5QWU2Bk0FFyL2cNl2jW6160VvvYPewLV1tj208L0Tzlm3hZugNVzrfucVFE7Bquua4zmwPew9fAmH-CGan6_vOMRvwbbDUDVbH2y_a-MduDaiiXr6Vydgs3jczJ-T1evTcl6tEolTypJa6lSkpFa5loilRBBc1IwUtUKGYKOlQbkWWCJVslrjssxraXBmasLKLC3oBCwvWOXFnnenP0Q4ci8sHxY-bLkIvZWN5irHkmCCMi1FWpyuKKOMoLRgVBBl5ImVXFgy-BiDNv88jPggng_i-Vk8Z_QXUCh9PQ
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.30537/sjcms.v1i1.8
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2522-3003
EndPage 66
ExternalDocumentID oai_doaj_org_article_d61c21205eca477b8dfdfa33783a2dfc
10_30537_sjcms_v1i1_8
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
OK1
ID FETCH-LOGICAL-c1438-bce4a42bd6ec0842a217b827bd0f21fecf06ea1c0d98be1996bcf15fb2895473
IEDL.DBID DOA
ISSN 2520-0755
IngestDate Fri Oct 03 12:51:42 EDT 2025
Sat Nov 29 03:19:32 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://creativecommons.org/licenses/by-nc/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1438-bce4a42bd6ec0842a217b827bd0f21fecf06ea1c0d98be1996bcf15fb2895473
OpenAccessLink https://doaj.org/article/d61c21205eca477b8dfdfa33783a2dfc
PageCount 9
ParticipantIDs doaj_primary_oai_doaj_org_article_d61c21205eca477b8dfdfa33783a2dfc
crossref_primary_10_30537_sjcms_v1i1_8
PublicationCentury 2000
PublicationDate 2017-06-30
PublicationDateYYYYMMDD 2017-06-30
PublicationDate_xml – month: 06
  year: 2017
  text: 2017-06-30
  day: 30
PublicationDecade 2010
PublicationTitle Sukkur IBA Journal of Computing and Mathematical Sciences (Online)
PublicationYear 2017
Publisher Sukkur IBA University
Publisher_xml – name: Sukkur IBA University
SSID ssib044762095
ssj0002784081
Score 1.9927758
Snippet In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 58
Title A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms
URI https://doaj.org/article/d61c21205eca477b8dfdfa33783a2dfc
Volume 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2522-3003
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002784081
  issn: 2520-0755
  databaseCode: DOA
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2522-3003
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044762095
  issn: 2520-0755
  databaseCode: M~E
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LSsQwFA0iLtyIouKbLMRdZ_Jqm1mO4iDIiOAs3JU8tTrtDG1nluJv-Ht-iUlaZVy5cVPog1DOTXLvJfeeA8C5iNWAJ4pGimAbMSpRJFFs3cJze6LExnlBFcQm0rs7_vg4uF-R-vI1YS09cAtcXyfYDUNQbJRgaSq5ttoKSlNOBdFW-d3XRT0ryZSbSYy5NY66jtOX7ngNBcVSErt8yfnJuCXcpJ7PpF-_qKLuLXGOe_yXg1rh8Q8OZ7QNtrpIEQ7bP9wBa6bcBdMhHIm6gYHUt-j6hko4s3Ccl3mxKODDvFUhgpPKGDgOAtFQlBr6eNP3NMG8gc0M3laL-lVMP98_6vD6vsqLcDOcPs2qvHku6j0wGV1Prm6iTjAhUl7FPJLKMMGI1IlRiDMiXL4hOUmlRtaZwiiLEiOwQnrApfH1x1JZHFvpsi6vQbwP1stZaQ4ApFxyF4sIJmN_LslFQiRlVnCMqLAaH4KLb5CyeUuLkbl0IqCZBTQzj2bGD8Glh_DnI89mHR44G2edjbO_bHz0H4Mcg03iXXKo9TsB6021MKdgQy2bvK7OwvRx1_Hb9Rf3hs2E
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Fast+Implementation+of+Minimum+Spanning+Tree+Method+and+Applying+it+to+Kruskal%E2%80%99s+and+Prim%E2%80%99s+Algorithms&rft.jtitle=Sukkur+IBA+Journal+of+Computing+and+Mathematical+Sciences+%28Online%29&rft.au=Munier%2C+Badri&rft.au=Aleem%2C+Muhammad&rft.au=Islam%2C+Muhammad+Arshad&rft.au=Iqbal%2C+Muhammad+Azhar&rft.date=2017-06-30&rft.issn=2520-0755&rft.eissn=2522-3003&rft.volume=1&rft.issue=1&rft.spage=58&rft.epage=66&rft_id=info:doi/10.30537%2Fsjcms.v1i1.8&rft.externalDBID=n%2Fa&rft.externalDocID=10_30537_sjcms_v1i1_8
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2520-0755&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2520-0755&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2520-0755&client=summon