Abstract

The work is dedicated to the parallelization of programs in especially difficult cases when the used algorithm is purely sequential, there are no parallel alternatives to this algorithm, and its execution time is unacceptably high. Various parallelization methods for software implementations of such algorithms and resulting computational load balancing are considered that make it possible to considerably accelerate the execution of application programs using purely sequential algorithms. The proposed methods are illustrated with examples of their application to two algorithms used in a dynamic binary code analysis toolset. The main goal of this paper is to show that the use of a purely sequential algorithm in a software implementation does not necessarily imply that its execution is inevitably sequential. The proposed methods of parallelizing implementations of such algorithms and balancing the resulting computational load can help develop efficient parallel programs that fully utilize the hardware capabilities of modern computers.

中文翻译：

---

纯序列算法实现的并行化

摘要

当使用的算法纯粹是顺序的，没有并行替代方案且执行时间过长时，在特别困难的情况下，该工作将致力于程序的并行化。考虑了用于这种算法的软件实现的各种并行化方法以及由此产生的计算负载平衡，这使得使用纯顺序算法可以显着加速应用程序的执行成为可能。举例说明了所提出的方法及其在动态二进制代码分析工具集中使用的两种算法的应用实例。本文的主要目的是表明，在软件实现中使用纯顺序算法并不一定意味着其执行不可避免地是顺序的。