Низкая результативность целевых программ обосновывает необходимость анализа их
разработки и реализации. В работе предлагаются методы и средства формализации …

Graphics Processor Units are used for many general purpose processing due to high
compute power available on them. Regular, data-parallel algorithms map well to the SIMD …

The Graphics Processing Units (GPUs) provide high computation power at a low cost and is
an important compute accelerator with a massively multithreaded architecture. In this paper …

The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a
sequential setting. Given a graph and a tree that spans it, the algorithm is required to check …

We present a randomized algorithm to find a minimum spanning forest (MSF) in an
undirected graph. With high probability, the algorithm runs in logarithmic time and linear …

Many modern parallel systems, such as MapReduce, Hadoop and Spark, can be modeled
well by the MPC model. The MPC model captures well coarse-grained computation on large …

We present the first randomized O (logn) time and O (m+ n) work EREW PRAM algorithm for
finding a spanning forest of an undirected graph G=(V, E) with n vertices and m edges. Our …

This paper introduces the notion of distributed verification without preprocessing. It focuses
on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight …

This paper establishes tight bounds for the Minimum-weight Spanning Tree (MST)
verification problem in the distributed setting. Specifically, we provide an MST verification …

The defining feature of many modern large-scale computer systems is the sheer amount of
data that they generate and process. Google's MapReduce clusters process over twenty …