Skip to main content
SpringerLink
Log in

Parallelization of Implementations of Purely Sequential Algorithms

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.

Similar content being viewed by others

REFERENCES

  1. Padaryan, V.A., Getman, A.I., Solovyev, M.A., Bakulin, M.G., Borzilov, A.I., Kaushan, V.V., Ledovskich, I.N., Markin, U.V., and Panasenko, S.S. Methods and software tools for combined binary code analysis, Trudy ISP RAN, 2014, vol. 26, no. 1, pp. 251–276.

    Google Scholar 

  2. Padaryan, V.A. On representation used in the binary code reverse engineering, Trudy ISP RAN, 2017, vol. 29, no. 3, pp. 31–42.

    Google Scholar 

  3. Getman, A., Padaryan, V., and Solovyev, M., Combined approach to solving problems in binary code analysis, Proc. of the 9th International Conference on Computer Science and Information Technologies (CSIT), 2013, pp. 295–297.

Download references

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, 125047, Moscow, Russia

    A. B. Bugerya

  2. Ivannikov Institute for System Programming, Russian Academy of Sciences, 109004, Moscow, Russia

    E. S. Kim & M. A. Solovev

Authors
  1. A. B. Bugerya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. S. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. A. Solovev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. B. Bugerya, E. S. Kim or M. A. Solovev.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bugerya, A.B., Kim, E.S. & Solovev, M.A. Parallelization of Implementations of Purely Sequential Algorithms. Program Comput Soft 45, 381–389 (2019). https://doi.org/10.1134/S0361768819070053

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768819070053

Search

Navigation