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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM International Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing pp. 408 - 414
Main Author: Bossard, Antoine
Format: Conference Proceeding
Language:English
Published: IEEE 19.08.2024
Subjects:
Data transfer
green HPC
Green products
Multiprocessor interconnection
Network topology
Parallel processing
parallel system
path
Power demand
Routing
Social computing
Supercomputers
supercomputing
Time complexity
ISSN:2836-3701
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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 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/IET Electronic Library (IEL) (UW System Shared)
  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.8802286
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/eLvHCXMwlV3NT8IwFG-UGKMXFDF-pwevVTq6vu2MEA8GSdCEG2m7NySRjbBh4n9v2w3w4sHTlqVNlr739j72fr9HyD3az2IkjGZJLLquWsWZsnE_AyHApB2wTsSz67_AcBhNJvGoBqt7LAwi-uYzfHC3_l9-kpu1K5VZCwergg42vg8gK7DWtqBiHSFIGR6Sfs2j-TivRl8y38FizYv1RmN3GS-sVJ5UqVjvW6OPDE0hAxF2bL4YODbtjufl201b8c5m0Pzna56Q9g62R0dbh3RK9jBrkeZmbgOtzbhFjn-REJ4R9ZrR0koUaepQIRXZP_VE1tT1yWOlI7QePVNQlSV2A1LjB3ssc4-LqTfMPIu1X68-Z_lqXn4sijZ5H_Tfes-sHrzA5hxkySBIJRibZttoSeuAIwqtolRDqHnoGfJNVyYmUdwEcRonyuVtmusQMNFSxd1z0sjyDC8IjRKUNgqBrsFYgBLKKkaMkeR2IXABl6TtDnC6rLg1ppuzu_rj-TU5cjJyVV0e35BGuVrjLTkwX-W8WN15jfgBkn26lA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8MGj8uKGL8tgevVbp17XZGCEZEEjDhRtruDUlkEDZM_O9tuwFePHjasrTJ0vfe3sfe7_cQugfzWQyZViSOmG-rVZRIE_cTwZjQSUMYJ-LY9bui1wtHo6hfgtUdFgYAXPMZPNhb9y8_nuuVLZUZCxdGBS1sfDdgzGsUcK1NScW4QsF5sI9aJZPm47QYfklcD4sxMNLsD-xlMDNyeZK5JM1vBS421Bn3WNAwGaNn-bQbjplvO2_FuZt29Z8veozqW-Ae7m9c0gnagbSGquvJDbg05Bo6-kVDeIrkW4pzI1PAicWFFHT_2FFZY9spD4WW4HL4TIZlGpsNgLUb7bGYO2RMuWHieKzdevk5mS-n-ccsq6P3dmvY7JBy9AKZUsFzIryEC20SbRMvKeVRAKZkmCgRKBo4jnzt81jHkmovSqJY2sxNURUIiBWXkX-GKuk8hXOEwxi4iUOEryFiQjJpVCOCkFOzUFAmLlDdHuB4UbBrjNdnd_nH8zt00Bm-dsfd597LFTq08rI1Xhpdo0q-XMEN2tNf-TRb3jrt-AFqmb3b
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