On three fundamental graph enumeration problems and the corresponding graph generation algorithms
Green supercomputing has been attracting more and more attention due to the acknowledgement of environmental issues. This is especially the case in the field of supercomputing: given the large number of compute nodes involved, the power consumption of these machines is high, in the order of tens of...
Uloženo v:
| Vydáno v: | IEEE/ACM International Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing s. 408 - 414 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
19.08.2024
|
| Témata: | |
| ISSN: | 2836-3701 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Green supercomputing has been attracting more and more attention due to the acknowledgement of environmental issues. This is especially the case in the field of supercomputing: given the large number of compute nodes involved, the power consumption of these machines is high, in the order of tens of megawatts. Efficient usage of supercomputers is thus key to minimise their power consumption, and one approach is to increase data transfer rates so that the computer can be returned into an energy efficient sleep mode rapidly. Parallel paths and especially disjoint paths routing is one solution to achieve such more efficient data transfers. Yet, the selection of mutually disjoint paths is complex, and in some cases graph enumeration can produce a solution whereas conventional approaches fail. The contribution of this paper is twofold: for the selected three fundamental graph enumeration problems, we give simple, easy to understand proofs that do not involve complex mathematical notions as in previous works; we describe and evaluate the corresponding graph generation algorithms and make comparisons to straightforward or conventional approaches. Not only theoretical evaluation but also empirical evaluation is conducted. Time complexity is shown to be optimal. |
|---|---|
| AbstractList | Green supercomputing has been attracting more and more attention due to the acknowledgement of environmental issues. This is especially the case in the field of supercomputing: given the large number of compute nodes involved, the power consumption of these machines is high, in the order of tens of megawatts. Efficient usage of supercomputers is thus key to minimise their power consumption, and one approach is to increase data transfer rates so that the computer can be returned into an energy efficient sleep mode rapidly. Parallel paths and especially disjoint paths routing is one solution to achieve such more efficient data transfers. Yet, the selection of mutually disjoint paths is complex, and in some cases graph enumeration can produce a solution whereas conventional approaches fail. The contribution of this paper is twofold: for the selected three fundamental graph enumeration problems, we give simple, easy to understand proofs that do not involve complex mathematical notions as in previous works; we describe and evaluate the corresponding graph generation algorithms and make comparisons to straightforward or conventional approaches. Not only theoretical evaluation but also empirical evaluation is conducted. Time complexity is shown to be optimal. |
| Author | Bossard, Antoine |
| Author_xml | – sequence: 1 givenname: Antoine surname: Bossard fullname: Bossard, Antoine organization: Kanagawa University,Graduate School of Science,Yokohama,Japan,221-8686 |
| BookMark | eNo1UFtLwzAYjaLgnPsHPvQPdObSJu2j1DmFwYTN5_Gl_XqRJi1J9rB_b0R9OnA4N849ubGTRUI2jK4Zo-XTcOwH2_l06xBtNZm0-jj8wMGACy8QIK0uGp2BMNRe8iyna055tqaUFvyKrEpVFiKnImdSqGuy4IWQqVCU3ZGV919RJphSUuYLAnubhD72JO3ZNmDQBhiTzsHcJ2jPBl0smWwyu0mPaHwCtokGTOrJOfTzZJs49c_Qof3Xw9hNbgi98Q_ktoXR4-oPl-TzdXOs3tLdfvtePe_SgSkZUsVbqWrUgstMa84QMw1Fq1WuWV7wQmW1kE3dAKt52ZYN8EhqpnOFjZZQiiV5_M0dEPE0uyGedTkxqgQrOBPfrANqUg |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/iThings-GreenCom-CPSCom-SmartData-Cybermatics62450.2024.00082 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore 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 | Engineering Computer Science |
| EISBN | 9798350351637 |
| EISSN | 2836-3701 |
| EndPage | 414 |
| ExternalDocumentID | 10731821 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Kanagawa University funderid: 10.13039/501100005965 |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI OCL RIE RIL |
| ID | FETCH-LOGICAL-i176t-72f67ceb3264bb21ee4ba8fb75b1582874c36dcda1c29f9da2828b1b57edb6a93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001551078200057&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 01:58:18 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i176t-72f67ceb3264bb21ee4ba8fb75b1582874c36dcda1c29f9da2828b1b57edb6a93 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_10731821 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Aug.-19 |
| PublicationDateYYYYMMDD | 2024-08-19 |
| PublicationDate_xml | – month: 08 year: 2024 text: 2024-Aug.-19 day: 19 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE/ACM International Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing |
| PublicationTitleAbbrev | ITHINGS-GREENCOM-CPSCOM-SMARTDATA-CYBERMATICS |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0003177665 |
| Score | 1.880334 |
| Snippet | Green supercomputing has been attracting more and more attention due to the acknowledgement of environmental issues. This is especially the case in the field... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 408 |
| SubjectTerms | Data transfer green HPC Green products Multiprocessor interconnection Network topology Parallel processing parallel system path Power demand Routing Social computing Supercomputers supercomputing Time complexity |
| Title | On three fundamental graph enumeration problems and the corresponding graph generation algorithms |
| URI | https://ieeexplore.ieee.org/document/10731821 |
| WOSCitedRecordID | wos001551078200057&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/eLvHCXMwlV3NS8MwFA86RPQynRO_ycFrtEnbpDnPiQeZg6nsNvLxOgeuG1sn-N-bpN3mxYOnlpBAyXuP99H3-z2EbhPGdCqEJblmLkHJtCbKQkwiCUpaamgceAven0Wvlw2Hsl-D1QMWBgBC8xnc-dfwL9_OzMqXypyFC6eCHja-KwSvwFqbgopzhILzdB91ax7N-0k1-pKEDhZnXqTTH_jHYOqk8qBKRTrfGkJkaJacJWnk8kXm2bSjwMu3nbYSnM1j85-feYTaW9ge7m8c0jHagaKFmuu5Dbg24xY6_EVCeILUS4FLJ1HAuUeFVGT_OBBZY98nD5WO4Hr0zBKrwroDgE0Y7DGfBVxMfWAcWKzDfvU5ni0m5cd02UZvj93XzhOpBy-QCRW8JILlXBiXZrtoSTsZAiRaZbkWqaZpYMg3MbfGKmqYzKVVPm_T1AkdrOZKxqeoUcwKOEOYCnCrNMuUTRLQUkXWxVA8VYppkUl2jtr-AkfziltjtL67iz_WL9GBl5Gv6lJ5hRrlYgXXaM98lZPl4iZoxA9C87vJ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZQQTwWoBTxxgOrIXaTOJ4LFYhSKrWgbpUfl1KJplUTkPj32E5KWRiYElm2FPnudI_c9x1CVyFjKuLckFQxm6AkShFpoEkCAVIYqmnT8xa8dni3mwyHoleB1T0WBgB88xlcu1f_L9_M9IcrlVkL51YFHWx8PQpDFpRwrZ-SinWFPI6jTXRXMWneTMrhl8T3sFgDI61e3z36UyuXW1lI0vpS4GNDnccsjAKbMTLHpx14Zr7VvBXvbtq7__zQPdRYAfdw78cl7aM1yOpodzm5AVeGXEc7v2gID5B8znBhZQo4dbiQku4feypr7DrlodQSXA2fybHMjD0AWPvRHvOZR8ZUB8aex9rvl-_j2WJSvE3zBnpp3w1a96QavUAmlMcF4SyNubaJto2XlJUiQKhkkioeKRp5jnzdjI02kmomUmGky9wUtWIHo2Ipmoeols0yOEKYcrCrNEmkCUNQQgbGRlFxJCVTPBHsGDXcBY7mJbvGaHl3J3-sX6Kt-8FTZ9R56D6eom0nL1fjpeIM1YrFB5yjDf1ZTPLFhdeObyu_vxA |
| 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=IEEE%2FACM+International+Conference+on+Green+Computing+and+Communications+%26+Int%27l+Conference+on+Cyber%2C+Physical+and+Social+Computing&rft.atitle=On+three+fundamental+graph+enumeration+problems+and+the+corresponding+graph+generation+algorithms&rft.au=Bossard%2C+Antoine&rft.date=2024-08-19&rft.pub=IEEE&rft.eissn=2836-3701&rft.spage=408&rft.epage=414&rft_id=info:doi/10.1109%2FiThings-GreenCom-CPSCom-SmartData-Cybermatics62450.2024.00082&rft.externalDocID=10731821 |