Zobrazeno 1 - 10
of 10
pro vyhledávání: '"O. N. Karasik"'
Autor:
O. N. Karasik, A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 2, Pp 4-10 (2024)
The problem of finding all shortest paths between vertices in a graph (APSP) has real-life applications in planning, communication, economics and many other areas. APSP problem can be solved using various algorithms, starting from Floyd-Warshall’s
Externí odkaz:
https://doaj.org/article/2d848650d157403996f4da45aadf6376
Autor:
A. A. Prihozhy, O. N. Karasik
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 4, Pp 4-13 (2024)
In real-world networks, many problems imply finding the All-Pairs Shortest Paths (APSP) and their distances in a graph. Solving the large-scale APSP problem on modern multi-processor (multi-core) systems is the key for various application domains. Th
Externí odkaz:
https://doaj.org/article/d3dc6af629a94126951317e0f5a6511a
Autor:
A. A. Prihozhy, O. N. Karasik
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 2, Pp 4-12 (2023)
Modern multi-core processors, operating systems and applied software are being designed towards energy efficiency, which significantly reduces energy consumption. Energy efficiency of software depends on algorithms it implements, and, on the way, it
Externí odkaz:
https://doaj.org/article/084062fd552a4a5282c41e3822df54bf
Autor:
O. N. Karasik, A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 3, Pp 57-65 (2022)
Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains. This paper analyzes the parallel blocked all-pairs shortest path algorithm at the aim of evaluat
Externí odkaz:
https://doaj.org/article/e90b68184c5d4ec786431f306c1f1f03
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 1, Pp 34-41 (2019)
An analysis of computational pipelines and their optimization methods has been performed. A class of dataflow pipelines that do not use resource sharing and obtain high throughput has been considered. Pipeline optimization tasks being solved during h
Externí odkaz:
https://doaj.org/article/f62011943d084f9b90d07c933992dfeb
Autor:
O. N. Karasik, A. A. Prihozhy
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 2, Pp 77-84 (2019)
The problem of finding the shortest paths on weighted graphs is considered. The variants of statement of the problem, known algorithms for it solving, areas of practical application and existing challenges, in particular, the challenge of scalability
Externí odkaz:
https://doaj.org/article/1cfaa21a5b0b4cd1b07ad9fef50f58bd
Autor:
A. A. Prihozhy, O. N. Karasik
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 3, Pp 68-75 (2017)
The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem
Externí odkaz:
https://doaj.org/article/7674cc861f23409f94de50a89e514606
Autor:
O. N. Karasik, A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 1, Pp 4-11 (2017)
Three architectures of the cooperative thread scheduler in a multithreaded application that is executed on a multi-core system are considered. Architecture A0 is based on the synchronization and scheduling facilities, which are provided by the operat
Externí odkaz:
https://doaj.org/article/b8f5c8f2d5314c13825070e91fd6cd1d
Autor:
A. A. Prihozhy, O. N. Karasik
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 2, Pp 10-18 (2015)
The problem of balancing the computational load among the cores of a multicore system and increasing the efficiency of interaction among threads in a multithread application is considered. The cooperative blockparallel algorithms of solving com
Externí odkaz:
https://doaj.org/article/7277af8a3e4a42cc8c32389c86a9dab8
Autor:
A. A. Prihozhy, O. N. Karasik
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 4, Pp 13-20 (2014)
The problem of the increase of efficiency of multi-thread applications on multi-core systems is investigated. The optimization cooperative model of threads execution has been proposed. It optimizes the execution order of the computational operations
Externí odkaz:
https://doaj.org/article/d54e8291792547d584ed881c83b492f9