Zobrazeno 1 - 10
of 52
pro vyhledávání: '"A. A. Prihozhy"'
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
Autor:
A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 1, Pp 40-46 (2022)
The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem. This paper solves the problem of formi
Externí odkaz:
https://doaj.org/article/6c8c1d14fafe41b79ef2cff6d23cd254
Autor:
A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 3, Pp 40-50 (2021)
This paper is devoted to the reduction of data transfer between the main memory and direct mapped cache for blocked shortest paths algorithms (BSPA), which represent data by a D[M×M] matrix of blocks. For large graphs, the cache size S = δ×M2, δ
Externí odkaz:
https://doaj.org/article/d4326ebad4f7432e96ae22225d3f5806
Autor:
A. A. Prihozhy, A. M. Zhdanouski
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 4, Pp 31-38 (2021)
The partitioning a set of professional programmers into a set of teams when a programming project specifies requirements to the competency in various programming technologies and tools is a hard combinatorial problem. The paper proposes a genetic alg
Externí odkaz:
https://doaj.org/article/0ec5d98df8774143a09e67563ddc78d2
Autor:
A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 2, Pp 61-70 (2020)
Addition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder architectures, and to developing advanced adder implementatio
Externí odkaz:
https://doaj.org/article/1fec6a67de1841e5a37e430bf65984d6
Autor:
A. A. Prihozhy
Publikováno v:
Sistemnyj Analiz i Prikladnaâ Informatika, Vol 0, Iss 4, Pp 10-18 (2019)
Caches are intermediate level between fast CPU and slow main memory. It aims to store copies of frequently used data and to reduce the access time to the main memory. Caches are capable of exploiting temporal and spatial localities during program exe
Externí odkaz:
https://doaj.org/article/6880d4a994354b3f81ae018bf85086fe
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