Optimization of the Functional Decomposition of Parallel and Distributed Computations in Graph Coloring With the Use of High-Performance Computing

This article presents methods for correct decomposition for high performance computations related to large sets of graphs. These computations contain large number of calls of sequential, recursive algorithm for NP-complete problem - proper edge coloring of graph. Decomposition of this computational...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access Jg. 10; S. 34996 - 35011
Hauptverfasser: Skrinarova, Jarmila, Dudas, Adam
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Computational efficiency
Computing time
Decomposition
distributed computing
Graph coloring
Graphs
High performance computing
Image color analysis
Load management
NP-complete problem
Optimization
parallel computing
Parallel processing
Program processors
Resource management
snark
Synchronism
Task analysis
ISSN:2169-3536, 2169-3536
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This article presents methods for correct decomposition for high performance computations related to large sets of graphs. These computations contain large number of calls of sequential, recursive algorithm for NP-complete problem - proper edge coloring of graph. Decomposition of this computational problem is not trivial, since the number of recursions in various parts of the computation is different and causes a high load and time imbalance. We designed, implemented and experimentally verified a new decomposition method that significantly reduces the computational time for a large set of graphs (up to 404 million graphs). This method ensures the same duration of computational time for partial subtasks and thus eliminates the need to wait for synchronization of parallel computations.
AbstractList This article presents methods for correct decomposition for high performance computations related to large sets of graphs. These computations contain large number of calls of sequential, recursive algorithm for NP-complete problem - proper edge coloring of graph. Decomposition of this computational problem is not trivial, since the number of recursions in various parts of the computation is different and causes a high load and time imbalance. We designed, implemented and experimentally verified a new decomposition method that significantly reduces the computational time for a large set of graphs (up to 404 million graphs). This method ensures the same duration of computational time for partial subtasks and thus eliminates the need to wait for synchronization of parallel computations.
Author Dudas, Adam
Skrinarova, Jarmila
Author_xml – sequence: 1
  givenname: Jarmila
  orcidid: 0000-0001-5387-4834
  surname: Skrinarova
  fullname: Skrinarova, Jarmila
  organization: Department of Computer Science, Faculty of Natural Sciences, Matej Bel University, Banská Bystrica, Slovakia
– sequence: 2
  givenname: Adam
  orcidid: 0000-0001-5517-9464
  surname: Dudas
  fullname: Dudas, Adam
  email: adam.dudas@umb.sk
  organization: Department of Computer Science, Faculty of Natural Sciences, Matej Bel University, Banská Bystrica, Slovakia
BookMark eNp9kc1u3CAUha0qkZomeYJskLr2hB8bzDJyfqVIiZREWSJsrmcYeYwLeNE-Rp84eDypqi6KhIDLOR_onm_Z0eAGyLILgleEYHl5Vdc3Ly8riildMcIpJeWX7IQSLnNWMn701_5rdh7CFqdRpVIpTrLfT2O0O_tLR-sG5DoUN4Bup6Gdz7pH19C63eiC_bx_1l73PfRIDwZd2xC9baYIBtVJN8U9JyA7oDuvx02q9s7bYY3ebdzs4W8BZs69XW_yZ_Cd8zs9tHDwJ-lZdtzpPsD5YT3N3m5vXuv7_PHp7qG-eszbAlcxh0pU1HBWcm66Bkta8oYXhglZCCYIIa3pCHQNJxXGUMmC8ooJY4C2pRalZqfZw8I1Tm_V6O1O-5_Kaav2BefXSvto2x4UTbyukF2apsCi0bIiVSkhtVSWRMys7wtr9O7HBCGqrZt8amBQlBcivS2lSCq5qFrvQvDQqdYuHYte214RrOZE1ZKomhNVh0STl_3j_fzx_10Xi8sCwB-HFAURkrAP5JCvHQ
CODEN IAECCG
CitedBy_id crossref_primary_10_1016_j_oceaneng_2025_122511
crossref_primary_10_1515_comp_2025_0042
crossref_primary_10_1007_s10791_024_09447_4
crossref_primary_10_3390_s23083985
Cites_doi 10.1145/800230.806984
10.37236/3430
10.1137/0210055
10.1109/Informatics47936.2019.9119253
10.1109/DCABES.2012.9
10.1016/j.ejc.2012.07.019
10.1109/IDT52577.2021.9497524
10.1201/EBK1439811924
10.1109/ICETA.2018.8572230
10.1109/PDCAT.2012.42
10.1016/j.tcs.2009.05.005
10.31341/jios.43.2.5
10.1109/TPDS.2018.2819670
10.1109/TFUZZ.2020.2973941
10.1016/j.jalgor.2004.06.008
10.4171/OWR/2016/2
10.1109/TKDE.2020.3015914
10.1109/TKDE.2019.2947458
10.1109/TII.2019.2960835
10.1016/j.dam.2012.07.018
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
DOA
DOI 10.1109/ACCESS.2022.3162215
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE Xplore Open Access Journals
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
METADEX
Technology Research Database
Materials Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Materials Research Database
Engineered Materials Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
METADEX
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Materials Research Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2169-3536
EndPage 35011
ExternalDocumentID oai_doaj_org_article_2711f49ff49d407ba981859e5369517a
10_1109_ACCESS_2022_3162215
9741791
Genre orig-research
GrantInformation_xml – fundername: The Ministry of Education, Science, Research and Sport of Slovak Republic—Implementation of New Trends in Computer Science to Teaching of Algorithmic Thinking and Programming in Informatics for Secondary Education
  grantid: KEGA 018UMB-4/2020
– fundername: High-Performance Computing (HPC) Center of Matej Bel University in Banská Bystrica using the HPC Infrastructure through by the Research & Development Operational Program
– fundername: Europian Regional Developement Fund (ERDF) (Slovak Infrastructure for HPC)
  grantid: ITMS 26230120002; 26210120002
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
ABAZT
ABVLG
ACGFS
ADBBV
AGSQL
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
ESBDL
GROUPED_DOAJ
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
OK1
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c408t-e8782d63566dfb09256b64d3794737111cdf1efb61800e89426837dde2c5a75a3
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000778880500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2169-3536
IngestDate Fri Oct 03 12:45:30 EDT 2025
Fri Sep 12 01:52:00 EDT 2025
Tue Nov 18 22:21:02 EST 2025
Sat Nov 29 06:32:00 EST 2025
Wed Aug 27 02:40:51 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0/legalcode
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c408t-e8782d63566dfb09256b64d3794737111cdf1efb61800e89426837dde2c5a75a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-5387-4834
0000-0001-5517-9464
OpenAccessLink https://ieeexplore.ieee.org/document/9741791
PQID 2647426997
PQPubID 4845423
PageCount 16
ParticipantIDs ieee_primary_9741791
proquest_journals_2647426997
doaj_primary_oai_doaj_org_article_2711f49ff49d407ba981859e5369517a
crossref_primary_10_1109_ACCESS_2022_3162215
crossref_citationtrail_10_1109_ACCESS_2022_3162215
PublicationCentury 2000
PublicationDate 20220000
2022-00-00
20220101
2022-01-01
PublicationDateYYYYMMDD 2022-01-01
PublicationDate_xml – year: 2022
  text: 20220000
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE access
PublicationTitleAbbrev Access
PublicationYear 2022
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
Pinchinat (ref28); 10669
ref11
ref10
ref2
Palúch (ref21) 2006
ref17
ref16
Stockmeyer (ref29)
Kollár (ref18) 2003
Marx (ref1) 2004; 48
Kollar (ref19) 2012; 31
ref23
ref26
ref25
ref22
(ref24) 2021
Vilaltella (ref5) 2013; 10
ref27
ref8
ref7
ref9
ref4
ref3
ref6
Gupta (ref20) 2003
References_xml – ident: ref2
  doi: 10.1145/800230.806984
– ident: ref23
  doi: 10.37236/3430
– ident: ref16
  doi: 10.1137/0210055
– ident: ref8
  doi: 10.1109/Informatics47936.2019.9119253
– ident: ref11
  doi: 10.1109/DCABES.2012.9
– volume: 10
  start-page: 263
  issue: 3
  year: 2013
  ident: ref5
  article-title: A simple and fast heuristic algorithm for edge-coloring of graphs
  publication-title: AKCE Int. J. Graphs Combinatorics
– ident: ref6
  doi: 10.1016/j.ejc.2012.07.019
– ident: ref9
  doi: 10.1109/IDT52577.2021.9497524
– ident: ref14
  doi: 10.1201/EBK1439811924
– volume: 10669
  start-page: 133
  volume-title: Dynamic Logic. New Trends and Applications. DALI 2017
  ident: ref28
  article-title: Model checking against arbitrary public announcement logic: A first-order-logic prover approach for the existential fragment
– volume-title: Quantitative Methods in Logistics
  year: 2006
  ident: ref21
– ident: ref7
  doi: 10.1109/ICETA.2018.8572230
– start-page: 98
  volume-title: Proc. 17th Annu. Symp. Found. Comput. Sci. (SFCS)
  ident: ref29
  article-title: Alternation
– ident: ref10
  doi: 10.1109/PDCAT.2012.42
– ident: ref3
  doi: 10.1016/j.tcs.2009.05.005
– ident: ref15
  doi: 10.31341/jios.43.2.5
– ident: ref17
  doi: 10.1109/TPDS.2018.2819670
– volume: 31
  start-page: 983
  year: 2012
  ident: ref19
  article-title: Aspect-oriented approach to metamodel abstraction
  publication-title: Comput. Informat.
– volume-title: Methods and Tools for Effective Parallel Computations
  year: 2003
  ident: ref18
– volume-title: High Performance Computing Center: High Performance Computing Center
  year: 2021
  ident: ref24
– ident: ref26
  doi: 10.1109/TFUZZ.2020.2973941
– ident: ref4
  doi: 10.1016/j.jalgor.2004.06.008
– ident: ref22
  doi: 10.4171/OWR/2016/2
– volume-title: Introduction to Parallel Computing
  year: 2003
  ident: ref20
– ident: ref12
  doi: 10.1109/TKDE.2020.3015914
– ident: ref27
  doi: 10.1109/TKDE.2019.2947458
– volume: 48
  start-page: 11
  issue: 1
  year: 2004
  ident: ref1
  article-title: Graph colouring problems and their applications in scheduling
  publication-title: Periodica Polytechnica Elect. Eng.
– ident: ref13
  doi: 10.1109/TII.2019.2960835
– ident: ref25
  doi: 10.1016/j.dam.2012.07.018
SSID ssj0000816957
Score 2.2878282
Snippet This article presents methods for correct decomposition for high performance computations related to large sets of graphs. These computations contain large...
SourceID doaj
proquest
crossref
ieee
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 34996
SubjectTerms Algorithms
Computational efficiency
Computing time
Decomposition
distributed computing
Graph coloring
Graphs
High performance computing
Image color analysis
Load management
NP-complete problem
Optimization
parallel computing
Parallel processing
Program processors
Resource management
snark
Synchronism
Task analysis
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxQAD4lOUL3lgJCJ2EjseoVCYoAMV3SwndkQlSFFb-CH8Yu5sUyohwcKQJXGc2D773lnn9wg5daKoLa_yJOWmSHLDWGLAqyQilQ0sf7ZoSuvFJuTdXTkaqcGS1BfmhAV64NBx51wy1uSqgctC8FEZhS5GuSITAA6kh0apVEvBlF-DSwaPZaQZYqk6v-j1oEUQEHIOcargHIVwl1yRZ-yPEis_1mXvbPqbZCOiRHoR_m6LrLh2m6wvcQfukI97mOwv8RQlnTQUkBztg5cKm3v0ymG2eEzJwucDM0XdlGdqWkuvkC8Xpa6cpUHYIezc0XFLb5DDGu6G3Dz6OJ4_-cqHM4f1YGZIMvg-bxDfh6K7ZNi_fujdJlFgIanztJwnrgR8YJGhTtimShXAn0rkNoM5KjPod1bbhrmmEgxgpSsVeHOIZ2FB5HVhZGGyPdJpJ63bJ1RZ45ThqDOhcpHlprY1sxmAUcmFY65L-Fdf6zqyj6MIxrP2UUiqdBggjQOk4wB1ydnipddAvvF78UscxEVRZM72N8CedLQn_Zc9dckOmsCiEoi3kMG1S46-TELHWT7TACYlHgVW8uA_Pn1I1rA5YYPniHTm0zd3TFbr9_l4Nj3xBv4JkFz7MQ
  priority: 102
  providerName: Directory of Open Access Journals
Title Optimization of the Functional Decomposition of Parallel and Distributed Computations in Graph Coloring With the Use of High-Performance Computing
URI https://ieeexplore.ieee.org/document/9741791
https://www.proquest.com/docview/2647426997
https://doaj.org/article/2711f49ff49d407ba981859e5369517a
Volume 10
WOSCitedRecordID wos000778880500001&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
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: DOA
  dateStart: 20130101
  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: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB21FQc4QKEgtpTKB44NTZzEjo9l24ULZQ9U9BY59kSs1GbR7pYjP4Jf3BnbDZVASD1kFWVtK9E485WZ9wDeoaqdl12V5dLWWWWLIrNkVTKV657Un6_7xgeyCX1-3lxemvkWHI29MIgYis_wPZ-Gb_l-6W44VXZMvi-jaW7DttYq9mqN-RQmkDC1TsBCRW6OT6ZTegYKAaWkyFRJydS394xPwOhPpCp_aeJgXmbPHnZju_A0uZHiJMr9OWzh8AKe3AMX3IPfX0gbXKc2S7HsBbl6YkZmLGb_xClyOXmq2eL_53bFxCpXwg5enDKgLnNhoReR-SGm9sRiEB8Z5JquxuI98W2x-R4Wv1gjr8OlI9n8T0NCmk9DX8LF7Ozr9FOWGBgyV-XNJsOGHAjPEHbK911uyD_qVOVLeol1qUlNOt8X2HeqIL8TG0PmngJe0pjS1VbXtnwFO8NywNcgjLdorGQiClOpsrLOu8KX5K1qqbDACcg70bQuwZMzS8ZVG8KU3LRRni3Ls03ynMDROOlHROf4__APLPNxKENrhwskzDa9qa2k5-or09PhKdrtrGGfxmBd0v4qtJ3AHm-AcZEk-wkc3O2gNqmBdUvepuZeYaP3_z3rDTzmG4w5nQPY2axu8C08cj83i_XqMCQI6Pfzr7PDsNtvAbRL-7M
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VgkR74FUqFgr4wLGhifNwfCxbliLKsodW9GY59kSs1Gar3S0_pL-YGccNlUBIHCJFiW0lGmdemfk-gHdYlc7LpkhSacuksFmWWLIqSZWqltSfL9vaB7IJNZ3W5-d6tgH7Qy8MIobiM3zPp-Ffvl-4a06VHZDvy2ia9-A-M2elfbfWkFFhCgldqggtlKX64HA8pregIFBKik0rKZn89o75CSj9kVblD10cDMzk8f892hN4FB1JcdhL_ilsYPcMtu_AC-7AzTfSB5ex0VIsWkHOnpiQIevzf-IIuaA8Vm3x_ZldMrXKhbCdF0cMqctsWOhFz_3QJ_fEvBOfGOaarvble-L7fP0jLH62Ql6Hi0eS2e-WhDifhj6Hs8nH0_FxEjkYElek9TrBmlwIzyB2lW-bVJOH1FSFz-kzVrkiRel8m2HbVBl5nlhrMvgU8pLOlK60qrT5Lmx2iw5fgNDeoraSqSh0UeWFdd5lPid_VckKMxyBvBWNcRGgnHkyLkwIVFJtenkalqeJ8hzB_jDpqsfn-PfwDyzzYSiDa4cLJEwTv1Uj6b3aQrd0eIp3G6vZq9FY5rS_MmVHsMMbYFgkyn4Ee7c7yERFsDLkbyruFtbq5d9nvYWHx6dfT8zJ5-mXV7DFD9tnePZgc728xtfwwP1cz1fLN2G3_wILvvzT
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=Optimization+of+the+Functional+Decomposition+of+Parallel+and+Distributed+Computations+in+Graph+Coloring+With+the+Use+of+High-Performance+Computing&rft.jtitle=IEEE+access&rft.au=Skrinarova%2C+Jarmila&rft.au=Dudas%2C+Adam&rft.date=2022&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=10&rft.spage=34996&rft.epage=35011&rft_id=info:doi/10.1109%2FACCESS.2022.3162215&rft.externalDocID=9741791
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon