Parallel Vertex Color Update on Large Dynamic Networks
We present the first GPU-based parallel algorithm to efficiently update vertex coloring on large dynamic networks. For single GPU, we introduce the concept of loosely maintained vertex color update that reduces computation and memory requirements. For multiple GPUs, in distributed environments, we p...
Gespeichert in:
| Veröffentlicht in: | Proceedings - International Conference on High Performance Computing S. 115 - 124 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.12.2022
|
| Schlagworte: | |
| ISSN: | 2640-0316 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We present the first GPU-based parallel algorithm to efficiently update vertex coloring on large dynamic networks. For single GPU, we introduce the concept of loosely maintained vertex color update that reduces computation and memory requirements. For multiple GPUs, in distributed environments, we propose priority-based ordering of vertices to reduce the communication time. We prove the correctness of our algorithms and experimentally demonstrate that for graphs of over 16 million vertices and over 134 million edges on a single GPU, our dynamic algorithm is as much as 20x faster than state-of-the-art algorithm on static graphs. For larger graphs with over 130 million vertices and over 260 million edges, our distributed implementation with 8 GPUs produces updated color assignments within 160 milliseconds. In all cases, the proposed parallel algorithms produce comparable or fewer colors than state-of-the-art algorithms. |
|---|---|
| AbstractList | We present the first GPU-based parallel algorithm to efficiently update vertex coloring on large dynamic networks. For single GPU, we introduce the concept of loosely maintained vertex color update that reduces computation and memory requirements. For multiple GPUs, in distributed environments, we propose priority-based ordering of vertices to reduce the communication time. We prove the correctness of our algorithms and experimentally demonstrate that for graphs of over 16 million vertices and over 134 million edges on a single GPU, our dynamic algorithm is as much as 20x faster than state-of-the-art algorithm on static graphs. For larger graphs with over 130 million vertices and over 260 million edges, our distributed implementation with 8 GPUs produces updated color assignments within 160 milliseconds. In all cases, the proposed parallel algorithms produce comparable or fewer colors than state-of-the-art algorithms. |
| Author | Khanda, Arindam Liang, Xin Das, Sajal K. Bhowmick, Sanjukta |
| Author_xml | – sequence: 1 givenname: Arindam surname: Khanda fullname: Khanda, Arindam email: akkcm@mst.edu organization: Missouri University of Science and Technology,Rolla,USA – sequence: 2 givenname: Sanjukta surname: Bhowmick fullname: Bhowmick, Sanjukta email: sanjukta.bhowmick@unt.edu organization: University of North Texas,Denton,USA – sequence: 3 givenname: Xin surname: Liang fullname: Liang, Xin email: xliang@mst.edu organization: Missouri University of Science and Technology,Rolla,USA – sequence: 4 givenname: Sajal K. surname: Das fullname: Das, Sajal K. email: sdas@mst.edu organization: Missouri University of Science and Technology,Rolla,USA |
| BookMark | eNotzE1OwzAQQGGDQKItvUEXvkDC2M5MnCUKP0WKoAvKtpomYxRIk8qJBL09SLB6m09vri76oRelVgZSY6C4WbebEgksphasTQHA5mdqWeTeEGFWZNbRuZpZyiABZ-hKzcfx41eBsThTtOHIXSedfpM4ybcuh26IentseBI99Lri-C767tTzoa31s0xfQ_wcr9Vl4G6U5X8Xavtw_1quk-rl8am8rZLWQjYlSJ5y5lAjZLZBKSRzjXNMPs99KHwgMRjqwmNgcXsMwaBlQIPEgm7vFmr1921FZHeM7YHjaWfAADmH7gftxkfT |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/HiPC56025.2022.00027 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781665494236 1665494239 |
| EISSN | 2640-0316 |
| EndPage | 124 |
| ExternalDocumentID | 10106335 |
| Genre | orig-research |
| GroupedDBID | 29H 29O 6IE 6IF 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i204t-56867aafc5042d5e9e43d33a68778f98f6e15fc985fae3b5ff152a05156ae53b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000990551500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:21:30 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i204t-56867aafc5042d5e9e43d33a68778f98f6e15fc985fae3b5ff152a05156ae53b3 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_10106335 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-Dec. |
| PublicationDateYYYYMMDD | 2022-12-01 |
| PublicationDate_xml | – month: 12 year: 2022 text: 2022-Dec. |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings - International Conference on High Performance Computing |
| PublicationTitleAbbrev | HIPC |
| PublicationYear | 2022 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0020125 |
| Score | 2.2507732 |
| Snippet | We present the first GPU-based parallel algorithm to efficiently update vertex coloring on large dynamic networks. For single GPU, we introduce the concept of... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 115 |
| SubjectTerms | Dynamic networks Graphics processing units Heuristic algorithms High performance computing Image color analysis Kernel Memory management Parallel algorithms Parallel/distributed algorithm Vertex coloring |
| Title | Parallel Vertex Color Update on Large Dynamic Networks |
| URI | https://ieeexplore.ieee.org/document/10106335 |
| WOSCitedRecordID | wos000990551500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b8IwELYK6tCJPqj6loeuaYkdv2ZaxIBQhoLYkO2cJaQqoBBQf35tJ1B16NDNsgdLZ92dv_N9_hB6JtZ6rONUUjjHk8wJk6hB5hJiBUgFTNhYzJlPxHQqFwuVt2T1yIUBgNh8Bi9hGN_yi7XdhVKZ93APYChlHdQRgjdkrSO68pGWtdy4dKBex6t86LM5YR4DkvgpJ_mtoBITyKj3z63PUf-HiofzY5K5QCdQXqLeQYsBt655hXiuqyCL8onnUNXwhYc-qlV4tgmIHq9LPAkt3_itEaDH06b7e9tHs9H7x3CctJoIyYoMsjphXHKhtbPMe1vBQEFGC0o1l0JIp6TjkDJnlWROAzXMOZ-gdRBy4RoYNfQadct1CTcIF8ym1l83uF_OjGXSAKGCeQc1RFmT3qJ-sMNy03x7sTyY4O6P-Xt0Fkzd9Ho8oG5d7eARndp9vdpWT_GwvgEoNJTK |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagIMFUHkXl7YE1kNjxay5URYQoQ1t1qxLnLFVCaZWmiJ-PnaRFDAxslj1YOuvu_J3v84fQA9HaYh2jvNwY7oVGZJ7yQ-MRLUAqYELXxZxpJOJYzmYqacnqNRcGAOrmM3h0w_otP1_qjSuVWQ-3AIZSto8OWBgSv6Fr7fCVjbWsZccFvnoaLZKBzeeEWRRI6m85yW8NlTqFDLv_3PwE9X7IeDjZpZlTtAfFGepu1Rhw65zniCdp6YRRPvAUygq-8MDGtRJPVg7T42WBI9f0jZ8bCXocN_3f6x6aDF_Gg5HXqiJ4C-KHlce45CJNjWbW33IGCkKaU5pyKYQ0ShoOATNaSWZSoBkzxqbo1Em58BQYzegF6hTLAvoI50wH2l44uF0OM81kBoQKZl00I0pnwSXqOTvMV83HF_OtCa7-mL9HR6PxezSPXuO3a3TszN50ftygTlVu4BYd6s9qsS7v6oP7BhlLmBE |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+-+International+Conference+on+High+Performance+Computing&rft.atitle=Parallel+Vertex+Color+Update+on+Large+Dynamic+Networks&rft.au=Khanda%2C+Arindam&rft.au=Bhowmick%2C+Sanjukta&rft.au=Liang%2C+Xin&rft.au=Das%2C+Sajal+K.&rft.date=2022-12-01&rft.pub=IEEE&rft.eissn=2640-0316&rft.spage=115&rft.epage=124&rft_id=info:doi/10.1109%2FHiPC56025.2022.00027&rft.externalDocID=10106335 |