Skip to main content
Springer Nature Link
Log in

On the minimal time required for execution of distributed concurrent processes in synchronous modes

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

Abstract

Methods of linear complexity are proposed for finding the minimum total time required for performing a given amount of computations in various modes of synchronous interaction of distributed heterogeneous concurrent processes.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Korolev, L.N.,Struktury EVM i ikh matematicheskoe obespechenie (Computer Architecture and Software), Moscow: Nauka, 1978.

    Google Scholar 

  2. Voevodin, V.V.,Matematicheskie osnovy parallel'nykh vychislenii (Mathematical Foundations of Parallel Computing), Moscow: Izd. Mosk. Univ., 1991.

    Google Scholar 

  3. Ivannikov, V.P. and Gaisaryan, S.S., Characteristics of Programming Systems for Vector-Pipeline Computers,Kibernetika i vychislitel'naya tekhnika (Cybernetics Computing), Mel'nikov, V.A., Ed., Moscow: Nauka, 1986, issue 2, pp. 3–17.

    Google Scholar 

  4. Kapitonova, Yu.V. and Kovalenko, N.S., On Distributing Resources among Concurrent Processes,Kibernetika, 1981, no. 3, pp. 17–20.

    Google Scholar 

  5. Ferrari, D.,Computer Systems Performance Estimation, Englewood Cliffs: Prentice Hall, 1978. Translated under the titleOtsenka proizvoditel'nosti vychislitel'nykh sistem, Moscow: Mir, 1981.

    Google Scholar 

  6. Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A.,Teoriya raspisanii: Mnogostadiinye sistemy (Scheduling Theory: Multistage Systems), Moscow: Nauka, 1989.

    Google Scholar 

  7. Kovalenko, N.S. and Metel'skii, V.M., Interaction Modes of Heterogeneous Distributed Concurrent Processes,Kibernetika i Sistemnyi Analiz, 1997, no. 3, pp. 31–43.

    Google Scholar 

Download references

Authors
  1. V. P. Ivannikov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. N. S. Kovalenko
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. V. M. Metel'skii
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivannikov, V.P., Kovalenko, N.S. & Metel'skii, V.M. On the minimal time required for execution of distributed concurrent processes in synchronous modes. Program Comput Soft 26, 268–274 (2000). https://doi.org/10.1007/BF02759320

Download citation

  • Issue Date:

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

Keywords