Skip to main content
SpringerLink
Log in

Optimal computer memory allocation for the Poisson flows

  • Stochastic Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

For the data making up Poisson processes, a method for optimal allocation of the computer memory consisting of serially positioned stacks was proposed.

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

Similar content being viewed by others

References

  1. Knuth, D.E., The Art of Computer Programming, Reading: Addison-Wesley, 1969. Translated under the title Iskusstvo programmirovaniya, Moscow: Nauka, 1976.

    MATH  Google Scholar 

  2. Yao, A.C., An Analysis of a Memory Allocation Scheme for Implementating Stacks, SIAM J. Comput., 1981, vol. 10, pp. 398–403.

    Article  MATH  MathSciNet  Google Scholar 

  3. Flajolet, P., The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle, Lec. Notes Comput. Sci., 1986, vol. 223, pp. 325–340.

    Article  MathSciNet  Google Scholar 

  4. Louchard, G. and Schott, R., Probabilistic Analysis of Some Distributed Algorithms, Lec. Notes Comput. Sci., 1990, vol. 431, pp. 239–253.

    MathSciNet  Google Scholar 

  5. Mazalov, V.V. and Sokolov, A.V., On Optimal Dynamic Allocation of the Nonpage Memory, in Upravlenie v dinamicheskikh sistemakh, Leningrad: VINITI, 1979.

    Google Scholar 

  6. Mazalov, V.V., On One Method of Dynamic Allocation of the Nonpage Memory, Programmirovanie, 1995, vol. 21, no. 4, pp. 183–185.

    MathSciNet  Google Scholar 

  7. Sokolov, A.V. and Lemetti, A.A., On the Problem of Optimal Stack Control, Probabilistic Methods in Discrete Mathematics, in Proc. Int. Conf., Utrecht: VSP Publisher, 2001, pp. 351–366.

    Google Scholar 

  8. Sokolov, A.V. and Tarasyuk, A.V., On Optimal Control of Cyclic Queues, in Trudy Inst. prikl. matem. issled., Karnts RAN (Proc. Inst. Applied Math. Studies, Karelia Research Center, Russ. Acad. Sci.), 2002, vol. 3, pp. 190–195.

    Google Scholar 

  9. Rozanov, Yu.A., Sluchainye protsessy (Random Processes), Moscow: Nauka, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematical Studies, Karelia Research Center, Russian Academy of Sciences, Petrozavodsk, Russia

    V. V. Mazalov

  2. Aichi University, Nagoya, Japan

    M. Tamaki

  3. Institute of Natural Resources, Ecology, and Cryology, Siberian Branch, Russian Academy of Sciences, Chita, Russia

    S. V. Vinnichenko

Authors
  1. V. V. Mazalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Tamaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. V. Vinnichenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © V.V. Mazalov, M. Tamaki, S.V. Vinnichenko, 2008, published in Avtomatika i Telemekhanika, 2008, No. 9, pp. 69–75.

This work was supported by the Russian Foundation for Basic Research, project no. 06-01-00128, and the Department of Mathematical Sciences of RAS, program “Mathematical and Algorithmic Problems of the New-generation Information Systems.”

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mazalov, V.V., Tamaki, M. & Vinnichenko, S.V. Optimal computer memory allocation for the Poisson flows. Autom Remote Control 69, 1510–1516 (2008). https://doi.org/10.1134/S0005117908090063

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117908090063

PACS numbers

Search

Navigation