Počet záznamov: 1
Optimization design for parallel coloring of a set of graphs in the High-Performance Computing
SYS 0280087 LBL 01277^^^^^2200265^^^450 005 20240312150938.2 014 $a 2-s2.0-85087619914 $2 SCOPUS 017 70
$a 10.1109/Informatics47936.2019.9119253 $2 DOI 035 $a biblio/169798 $2 CREPC2 100 $a 20200116d2019 m y slo 03 ba 101 0-
$a eng 102 $a US 200 1-
$a Optimization design for parallel coloring of a set of graphs in the High-Performance Computing $f Adam Dudáš, Jarmila Škrinárová, Eduard Vesel 330 $a © 2019 IEEE. This paper presents solution to problem of edge coloring of sizable set of cubic graphs and examination of relations between these graphs. We solved this problem on various computing systems and for various sizes of the problem (various number of graphs). For the computations we used High-Performance Computing Cluster and Amazon Web Services cloud environment. We measured and analyzed time of computation of edge coloring and other properties. Largest set we worked with contained almost 10 million graphs. We created new methodology, which can be used to finding order of the edges which optimizes time of computation of edge coloring for certain subset of graphs. On the basis of this methodology, we implemented algorithm for parallel edge coloring of set of graphs. For testing of the methodology, we designed 8 experiments. Results showed, that worst time of edge coloring of graph from set of 19 935 graphs before use of the methodology was 1260 ms. After application of our methodology, we found same order of edge coloring for whole group of 19 935 graphs and the highest time of coloring was 10 ms. 463 -1
$1 001 umb_un_cat*0278558 $1 010 $a 978-1-7281-3178-8 $1 200 1 $a IEEE 15th International Scientific Conference on Informatics $e informatics 2019 $e proceedings, 20.-22.11.2019, Poprad $v Pp. 93-99 $1 205 $a 1. vyd. $1 210 $a New York $c Institute of Electrical and Electronics Engineers $d 2019 $1 710 11 $3 umb_un_auth*0279015 $a IEEE International Scientific Conference on Informatics $b Informatics 2019 $d 15. $e Poprad $f 20.-22.11.2019 606 0-
$3 umb_un_auth*0197430 $a paralelné počítanie $X parallel computing 606 0-
$3 umb_un_auth*0087860 $a kubické grafy 606 0-
$3 umb_un_auth*0245545 $a vysokovýkonné počítanie 606 0-
$3 umb_un_auth*0218357 $a HPC 606 0-
$3 umb_un_auth*0037454 $a algoritmy 606 0-
$3 umb_un_auth*0035685 $a informatika $X informatics 608 $3 umb_un_auth*0273283 $a príspevky v zborníku $X proceedings papers 700 -1
$3 umb_un_auth*0243847 $a Dudáš $b Adam $f 1992- $9 40 $4 070 701 -0
$3 umb_un_auth*0002916 $a Škrinárová $b Jarmila $f 1962- $p UMBFP05 $9 40 $4 070 $T Katedra informatiky 701 -1
$3 umb_un_auth*0209464 $a Vesel $b Eduard $4 070 $9 20 801 $a SK $b BB301 $g AACR2 $9 unimarc sk T85 $x existuji fulltexy
Počet záznamov: 1