Skip to main content
SpringerLink
Log in

Discrete optimization methods for multiprocessor computer systems

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. M. Garey and T. Johnson, Computers and Intractability, Freeman, San Francisco (1979).

    Google Scholar 

  2. Ch. Papadimitrious and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ (1982).

    Google Scholar 

  3. I. V. Sergienko, Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1985).

    Google Scholar 

  4. D. Davis (ed.), Concurrent Systems [Russian translation], Mir, Moscow (1985).

    Google Scholar 

  5. V. V. Voevodin, Mathematical Models and Methods in Parallel Processes [Russian translation], Mir, Moscow (1986).

    Google Scholar 

  6. V. S. Mikhalevich, Yu. V. Kapitonova, A. A. Letichevskii, I. N. Molchanov, and S. B. Pogrebinskii, “Organization of computations in multiprocessor computing systems,” Kibernetika, No. 3, 1–10 (1984).

    Google Scholar 

  7. V. S. Mikhalevich, Yu. V. Kapitonova, and A. A. Letichevskii, “On methods of organization of macropipelined computations,” Kibernetika, No. 3, 3–10 (1986).

    Google Scholar 

  8. I. N. Molchanov (ed.), Numerical Methods for the ES Multiprocessor Computer System [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  9. B. W. Wah, L.-J. Li, and C.-F. Yu, “The status of MANIP—a multicomputer architecture for solving combinatorial extremum-search problems,” 11th Ann. Int. Symp. Computer Architecture, Ann. Arbor, Mich., 5–7 June, 1984, Silver Springs (1984), pp. 56–63.

  10. D. J. Kuck, “Multioperation machine computational complexity,” in: Complexity of Sequential and Parallel Numerical Algorithms, J. F. Traub (ed.), Academic Press, New York (1973), pp. 17–47.

    Google Scholar 

  11. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, Winston, New York (1976).

    Google Scholar 

  12. T. Ibaraki, “Theoretical comparison in search strategies in branch-and-bound algorithms,” Int. J. Comput. Inform. Sci.,5, No. 4, 315–344 (1976).

    Google Scholar 

  13. L. F. Gulyanitskii and I. V. Sergienko, “On implementation of the branch-and-bound method in multiprocessor computer system,” in: Problems of Creation of Supercomputers. Supersystems, and Efficiency of Their Application, 1st All-Union Conf., abstracts of papers [in Russian], Part 2, Minsk (1987), pp. 25–27.

  14. D. Knuth, The Art of Computer Programming, Sorting and Searching, Vol. 3, Addison-Wesley, Reading, Mass. (1975).

    Google Scholar 

Download references

Authors
  1. L. F. Gulyanitskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. N. Khodzinskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 26–33, July–August, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gulyanitskii, L.F., Sergienko, I.V. & Khodzinskii, A.N. Discrete optimization methods for multiprocessor computer systems. Cybern Syst Anal 24, 418–427 (1988). https://doi.org/10.1007/BF01070581

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070581

Keywords

Search

Navigation