Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "c1f39a4b-6bbf-44d4-9553-f2968dfa427a"}, "_deposit": {"id": "3311", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3311"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3311", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Parallel Implementation of Prim’s Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs are widely used in manyapplications. Some of the applications that usedgraph theory are: analysis of electrical circuits,route planning, genetics, social sciences and soon. The system is based on sequential algorithm ofPrim and will focus on its parallelization targetingon message passing through the server and theclient. This system will introduce 2 strategies toparallel the sequential Prim’s algorithm forfinding minimum spanning tree (MST) on clientserverarchitecture. In the first strategy, the serverwill compute the global minimum spanning tree byasking the local minimum-weight edges of theclient every step of the computation. Server andclient follow every step of the Prim Algorithm andexchange the messages back and forth until theglobal minimum spanning tree is achieved. In thelater strategy, the server and client parallelcompute the local minimum spanning tree basedon their sub-graphs and then the client sends itslocal minimum spanning tree to the server. Theserver combines all local minimum spanning treesand calculates a global one."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-19"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "216_PDFsam_PSC_final proof.pdf", "filesize": [{"value": "322 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 322000.0, "url": {"url": "https://meral.edu.mm/record/3311/files/216_PDFsam_PSC_final proof.pdf"}, "version_id": "be8bb9b2-fdb6-4d86-8649-4ccef3fba8ce"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eighth Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Nyein, May Khine"}, {"subitem_authors_fullname": "Khaing, Myo"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2017-12-27"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1074"}, "item_title": "Parallel Implementation of Prim’s Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003311", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-19"}, "publish_date": "2019-07-19", "publish_status": "0", "recid": "3311", "relation": {}, "relation_version_is_last": true, "title": ["Parallel Implementation of Prim’s Algorithm"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Parallel Implementation of Prim’s Algorithm

http://hdl.handle.net/20.500.12678/0000003311
http://hdl.handle.net/20.500.12678/0000003311
3d88de05-29ce-4e5a-b9d0-5b6ed425ac98
c1f39a4b-6bbf-44d4-9553-f2968dfa427a
None
Preview
Name / File License Actions
216_PDFsam_PSC_final 216_PDFsam_PSC_final proof.pdf (322 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 09:56:08.802012
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL