Journal of Mathematical Sciences

, Volume 72, Issue 5, pp 3354–3358 | Cite as

Parallel algorithm for linear diophantine equations

  • I. A. Perekhod
Discrete Mathematics and Informatics
Received:
  • 19 Downloads

Abstract

We consider a parallel-sequential algorithm to find all the solution of a linear Diophantine equation anxn + an — 1xn — 1 + ⋯ +a1x1 = b, ai, b, xi ∈ Z+ by the method of dynamic upper bounds. Parallel processing and dichotomizing search are responsible for logarithmic time complexity of the algorithm. The auxiliary table memory requirements are 3n words. The algorithm can be applied in linear integer programming problems.

Keywords

Time Complexity Programming Problem Integer Programming Parallel Processing Parallel Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-L. Baer, R. Barlow, and M. Woodward, Parallel Processing Systems [Russian translation], Moscow (1985).Google Scholar
  2. 2.
    V. A. Val'kovskii, V. E. Kotov, and A. G. Marchuk, Elements of Parallel Programming [in Russian], Moscow (1985).Google Scholar
  3. 3.
    M. Gary and D. Johnson, Computers and Intractability [Russian translation], Moscow (1982).Google Scholar
  4. 4.
    M. Zelkovicz, A. Show, and J. Gannon, Software Development Principles [Russian translation], Moscow (1982).Google Scholar
  5. 5.
    D. Ya. Levin, A High-Level Language Programming-Support System [in Russian], Moscow (1987).Google Scholar
  6. 6.
    I. A. Perekhod and V. N. Kasatkin, "An optimal algorithm to solve LDE," in: Procs. All-Union Seminar on Optimization of Computations [in Russian], Kiev (1987), pp. 160–161.Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • I. A. Perekhod

There are no affiliations available

Personalised recommendations