2022
DOI: 10.1109/access.2022.3162215
|View full text |Cite
|
Sign up to set email alerts
|

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

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 decomposit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 22 publications
(39 reference statements)
0
0
0
Order By: Relevance
“…In Table 2, the abbreviation LS indicates the number of neurons allocated for the latent space, which was determined experimentally to be half the number of features in the state space. In the future, the training process is expected to be accelerated through distributed parallelization [45][46][47]. The cumulative intrinsic and extrinsic rewards obtained by an agent throughout a single episode are represented by the intrinsic and extrinsic scores shown in the following figures.…”
Section: Resultsmentioning
confidence: 99%
“…In Table 2, the abbreviation LS indicates the number of neurons allocated for the latent space, which was determined experimentally to be half the number of features in the state space. In the future, the training process is expected to be accelerated through distributed parallelization [45][46][47]. The cumulative intrinsic and extrinsic rewards obtained by an agent throughout a single episode are represented by the intrinsic and extrinsic scores shown in the following figures.…”
Section: Resultsmentioning
confidence: 99%