Browsing by Author "Prihozhy, A. A."

Now showing items 1-20 of 25

    • Analysis, transformation and optimization for high perfomance parallel computing 

      Prihozhy, A. A. (BNTU, 2019)
      This book studies hardware and software specifications at algorithmic level from the point of measuring and extracting the potential parallelism hidden in them. It investigates the possibilities of using this parallelism for the synthesis and optimization of highperformance software and hardware implementations. The basic single-block flow model is a result of the algorithm ...
      2019-08-12

    • Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters 

      Karasik, O. N.; Prihozhy, A. A. (БНТУ, 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 algorithm and ending with advanced, much faster blocked algorithms like Heterogeneous Blocked All-Pairs Shortest Path Algorithm designed ...
      2024-08-30

    • Combinatorial problem of allocating experts to programmer teams 

      Prihozhy, A. A. (БНТУ, 2022)
      Prihozhy, A. A. Combinatorial problem of allocating experts to programmer teams / A. A. Prihozhy // Информационные технологии в образовании, науке и производстве [Электронный ресурс] : IX Международная научно-техническая интернет-конференция, 20-22 ноября 2021 года / сост. Е. А. Хвитько. – Минск : БНТУ, 2022. – С. 22-32.
      2022-03-18

    • Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison 

      Prihozhy, A. A.; Karasik, O. N. (БНТУ, 2024)
      In this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken Dijkstra's algorithm with dynamically varying binary heap, which solves the APSP prob-lem purely in parallel by repeatedly ...
      2024-12-27

    • Dataflow network of cal-actors for all-pair shortest paths search 

      Prihozhy, A. A. (БНТУ, 2022)
      Prihozhy, A. A. Dataflow network of cal-actors for all-pair shortest paths search / A. A. Prihozhy // Информационно-коммуникационные технологии в управлении, образовании, науке [Электронный ресурс] : материалы международной научно-технической конференции, Минск, 20 мая 2022 г. / сост. М. Г. Карасёва. – Минск : БНТУ, 2022. – С. 24-30.
      2023-01-23

    • Evaluating professional competency of programmer teams 

      Prihozhy, A. A. (БНТУ, 2021)
      Prihozhy, A. A. Evaluating professional competency of programmer teams / A. A. Prihozhy // Информационные технологии в технических и естественных науках [Электронный ресурс] : материалы Республиканской научно-практической конференции, 20 мая 2021 г. / редкол.: А. М. Авсиевич [и др.] ; сост. В. А. Мартинович. – Минск : БНТУ, 2021. – С. 11-16.
      2021-12-07

    • Exact and greedy algorithms of allocating experts to maximum set of programmer teams 

      Prihozhy, A. A. (БНТУ, 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 forming the maximum number of teams whose experts meet all the constraints within each team. It develops and compares two algorithms: a ...
      2022-06-09

    • Genetic algorithm of optimizing the qualification of programmer teams 

      Prihozhy, A. A.; Zhdanouski, A. М. (БНТУ, 2020)
      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 algorithm, which is capable of finding competitive and high-quality partitioning solutions in acceptable runtime. The algorithm introduces ...
      2021-01-28

    • If-decision diagram based generation of parallel adders 

      Prihozhy, A. A. (БНТУ, 2021)
      Prihozhy, A. A. If-decision diagram based generation of parallel adders / A. A. Prihozhy // Информационные технологии в технических и естественных науках [Электронный ресурс] : материалы Республиканской научно-практической конференции, 20 мая 2021 г. / редкол.: А. М. Авсиевич [и др.] ; сост. В. А. Мартинович. – Минск : БНТУ, 2021. – С. 21-25.
      2021-12-07

    • Inference of low fan-out if-decision diagrams for logarithmic-depth adders 

      Prihozhy, A. A. (БНТУ, 2022)
      Prihozhy, A. A. Inference of low fan-out if-decision diagrams for logarithmic-depth adders / A. A. Prihozhy // Информационно-коммуникационные технологии в управлении, образовании, науке [Электронный ресурс] : материалы международной научно-технической конференции, Минск, 20 мая 2022 г. / сост. М. Г. Карасёва. – Минск : БНТУ, 2022. – С. 8-14.
      2023-01-23

    • Inference of reversible decision diagrams for modelling adders 

      Prihozhy, A. A. (БНТУ, 2025)
      The quantum logical circuits are reversible since they are defined through using Boolean conjunction, exclusive-or and constants. We propose a technique of inferring ternary reversible decision diagrams at the aim of modelling and synthesis of quantum parallel many-bit adders.
      2025-04-10

    • Influence of shortest path algorithms on energy consumption of multi-core processors 

      Prihozhy, A. A.; Karasik, O. N. (БНТУ, 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 exploits hardware resources. In the paper, we consider sequential and parallel implementations of four algorithms of shortest paths ...
      2023-10-13

    • Modelling reversible circuits by if-decision diagrams 

      Prihozhy, A. A. (БНТУ, 2020)
      Prihozhy, A. A. Modelling reversible circuits by if-decision diagrams / A. A. Prihozhy // VIII Международная научно-техническая интернет-конференция "Информационные технологии в образовании, науке и производстве", 21-22 ноября 2020 года [Электронный ресурс] / Белорусский национальный технический университет ; сост. Е. В. Кондратёнок. – Минск : БНТУ, 2020. – С. 163-168.
      2021-02-25

    • New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes 

      Prihozhy, A. A.; Karasik, O. N. (БНТУ, 2023)
      BelarusIn 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 muti-processor (multi-core) systems is the key for various application domains. The computational cost of solving the problem is high, therefore in many cases approximate solutions are considered as acceptable. ...
      2024-01-19

    • Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms 

      Prihozhy, A. A. (БНТУ, 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, δ < 1 is smaller than the matrix size. The cache assigns a group of main memory blocks to a single cache block. BSPA performs multiple ...
      2021-10-01

    • Random algorithm of forming programming teams accounting for compatibility of programmers 

      Prihozhy, A. A. (БНТУ, 2024)
      The compatibility of programmers is one of the main sources of increasing the efficiency of operation of programming teams. In the paper, we have proposed a random algorithm of forming teams which account for compatibility of programmers and their influence on the teams’ runtime costs. Experimental results have shown that the random algorithm forms the teams which reduce the ...
      2024-06-04

    • Realization of if-decision diagrams by reversible circuits 

      Prihozhy, A. A. (БНТУ, 2020)
      Prihozhy, A. A. Realization of if-decision diagrams by reversible circuits / A. A. Prihozhy // VIII Международная научно-техническая интернет-конференция "Информационные технологии в образовании, науке и производстве", 21-22 ноября 2020 года [Электронный ресурс] / Белорусский национальный технический университет ; сост. Е. В. Кондратёнок. – Минск : БНТУ, 2020. – С. 169-173.
      2021-02-25

    • Reduction of processor time and energy consumption by profiling algorithms of finding shortest paths in a graph 

      Prihozhy, A. A.; Subbota, Y. М. (БНТУ, 2023)
      Prihozhy, A. A. Reduction of processor time and energy consumption by profiling algorithms of finding shortest paths in a graph / А. А. Prihozhy, Y. М. Subbota // Информационные технологии в образовании, науке и производстве [Электронный ресурс] : материалы научно-технической интернет-конференции, Минск, 21-22 ноября 2022 г. / сост. М. Г. Карасёва. – Минск : БНТУ, 2023. – С. 176-182.
      2023-05-15

    • Reversible if-decision diagrams 

      Prihozhy, A. A. (БНТУ, 2022)
      Prihozhy, A. A. Reversible if-decision diagrams / A. A. Prihozhy // Информационно-коммуникационные технологии в управлении, образовании, науке [Электронный ресурс] : материалы международной научно-технической конференции, Минск, 20 мая 2022 г. / сост. М. Г. Карасёва. – Минск : БНТУ, 2022. – С. 15-23.
      2023-01-23

    • Simulation of direct mapped, k-way and fully associative cache on all pairs shortest paths algorithms 

      Prihozhy, A. A. (БНТУ, 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 execution. When the processor accesses memory, the cache behavior depends on if the data is in cache: a cache hit occurs if it is, and, ...
      2020-01-09