Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

An optimal dynamic dispatching algorithm in computer systems

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

Literature Cited

  1. 1.

    V. S. Korolyuk and I. I. Ezhov, “Semi-Markov processes and their application,” Kibernetika, No. 5 (1967).

  2. 2.

    S. M. Brodi and I. A. Pogosyan, Embedded Stochastic Processes in Queuing Theory [in Russian], Naukova Dumka, Kiev (1973).

  3. 3.

    S. M. Brodi and V. D. Shpak, “Application of associated semi-Markov processes in reliability analysis,” Kibernetika, No. 5 (1970).

  4. 4.

    R. Bellman, Dynamic Programming, Princeton University Press, Princeton (1957).

  5. 5.

    W. S. Jewell, “Controlled semi-Markov processes,” in: Cybernetic Collection [Russian translation], Vol. 1, Moscow (1967).

  6. 6.

    R. A. Howard, Dynamic Programming and Markov Processes, Massachusetts Institute of Technology Press, Cambridge, Massachusetts (1966).

  7. 7.

    J. G. Kemeny and J. L. Snell, Finite Markov Chains, Van Nostrand Reinhold, Princeton (1967).

Download references

Additional information

Translated from Kibernetika, No. 4, pp. 44–48, July–August, 1976.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Brodi, S.M., Pogosyan, I.A. & Kasyan, A.A. An optimal dynamic dispatching algorithm in computer systems. Cybern Syst Anal 12, 539–543 (1976).

Download citation


  • Operating System
  • Artificial Intelligence
  • Computer System
  • System Theory
  • Dispatch