Søgeresultater - A. A. Prihozhy

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 implementation technologies. Decision diagrams are a promising...

Fuld beskrivelse

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 ca...

Fuld beskrivelse

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...

Fuld beskrivelse

The Boolean function expansions and representation forms which are based on exclusive or operation are a key facility for design, test and diagnosis of digital systems and computer programs. The Zhegalkin polynomials, ReedMuller expressions and functional binary decision diagrams are among them. In...

Fuld beskrivelse

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...

Fuld beskrivelse

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 cons...

Fuld beskrivelse

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 an...

Fuld beskrivelse

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, are analyzed. The class of block-parallel algori...

Fuld beskrivelse

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 bloc...

Fuld beskrivelse

The problem of execution management of client’s tasks and optimal management of cluster’s computing resources is one of the key problems in grid. In this paper the detailed investigation and comparison of task schedulers and task scheduling techniques has been performed with respect to the result qu...

Fuld beskrivelse

The problem of building and optimizing the teams of programmers taking into account the qualification and the level of skills in programming technologies and tools is considered. Known technological environments for the management of teamwork, such as Agile, formulate only general requirements and p...

Fuld beskrivelse

The problem of balancing the computational load among the cores of a multi­core system and increasing the efficiency of interaction among threads in a multi­thread application is considered. The cooperative block­parallel algorithms of solving complex tasks that can be decomposed into subtasks, whic...

Fuld beskrivelse

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 are known. A new heterogeneous block algorithm is...

Fuld beskrivelse

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 va...

Fuld beskrivelse

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 operating system. Architecture A1 introduces a new synch...

Fuld beskrivelse

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. The computational cost of solving the problem is hig...

Fuld beskrivelse

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 and the operations of data exchange, decreases th...

Fuld beskrivelse

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 evaluating the influence of the multi-core system and its...

Fuld beskrivelse

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 high-level synthesis from random logic behavioral s...

Fuld beskrivelse