Improved Process of Running Tasks in the High Performance Computing System

Dudáš, Adam; Voštinár, Patrik; Škrinárová, Jarmila; Siláči, Jozef

doi:10.1109/iceta.2018.8572230

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• In paper [7], we briefly introduced the proper edge coloring of graphs in the context of parallel and distributed computations while using various initial edges to color the graph implemented via permutation of the adjacency matrix of the graph.…”

Section: Related Workmentioning

confidence: 99%

“…We have also shown the use of adjacency matrix permutation as a mean to work with these patterns and subgraphs more efficiently. Novel approach presented in this article is based directly on the work and concepts presented in [7]- [9]. These basic concepts are presented in the section V .…”

Section: Related Workmentioning

confidence: 99%

“…Thus, we must reduce the computational time of edge coloring. In [7] and [8], we showed that one graph can be colored at different times if we color it in different orders of edges. In the whole paper, we use the label permutation of graph as this changed order of edge coloring.…”

Section: Models Of Parallel Computations For Edge Coloring Of Graphsmentioning

confidence: 99%

“…In [7] and [8], we show that it is possible to find the order of edge coloring of the graph (permutation), which reduces the computational time of edge coloring for the whole group after it is applied to the entire set of graphs. In Figures 7 and 8, we present a comparison of the maximal computational times of edge coloring for a set of graphs while using randomly generated permutations (Fig.…”

Section: The Algorithms Of Functional Decomposition Based On Clusteri...mentioning

confidence: 99%

See 3 more Smart Citations

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

Škrinárová

Dudáš

2022

IEEE Access

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Models Of Parallel Computations For Edge Coloring Of Graphsmentioning

confidence: 99%

Section: The Algorithms Of Functional Decomposition Based On Clusteri...mentioning

confidence: 99%

See 2 more Smart Citations

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

Škrinárová

Dudáš

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

Vulnerability of Smart IoT-Based Automation and Control Devices to Cyber Attacks

Horák

Šimon

Huraj

et al. 2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

The Complexity of the Data Retrieval Process Using the Proposed Index Extension

Kvet

Papán²

2022

IEEE Access

View full text Add to dashboard Cite

Data retrieval, access, and tuple identification are inevitable in database processing, ensuring performance. The entities and relationships form a relational database. Data themselves are not specifically formatted, requiring sequential data block scanning if the particular index is unavailable. This paper summarizes existing indexing principles focusing on the B+tree, which forms the default structure for data access based on the index key. Such design is reliable and prone to an increase in the amount of data. However, it cannot manage undefined values properly, whereas they cannot be mathematically compared. Secondly, migrated rows can be present due to the size demand extension after the update operation. Thirdly, the index is always balanced, resulting in additional demands of the transaction. All these factors are covered by the proposed paper, discussing the limitations, opportunities, and own solutions to improve the performance. Several architectures are discussed, maintained, and computationally studied, focusing on the size demands, processing time, and costs. By using proposed techniques, significant improvements can be reached. A pointer list is introduced for migrated row management to reference the index set from the data block and store reference path or using a data reflector. When dealing with transaction support, index management and rebalancing are shifted to the separate autonomous transaction. Thanks to that, the main transaction can be approved sooner with no reliability issues. Finally, the proposed paper introduces the NULL value management structure in the instance memory for the index node reference.

show abstract

Improved Process of Running Tasks in the High Performance Computing System

Cited by 4 publications

References 11 publications

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

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

Vulnerability of Smart IoT-Based Automation and Control Devices to Cyber Attacks

The Complexity of the Data Retrieval Process Using the Proposed Index Extension

Contact Info

Product

Resources

About