Skip to main content
Log in

An optimal dynamic dispatching algorithm in 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

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

Instant access to the full article PDF.

Literature Cited

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

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

    Google Scholar 

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

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

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

Download references

Authors

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). https://doi.org/10.1007/BF01070387

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation