Skip to main content
SpringerLink
Log in

Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Included in the following conference series:

Abstract

This paper concerns issues related to building mathematical models and optimal algorithms of stacks and queues [1] control in single- and two-level memory. These models were constructed as 1, 2 and 3-dimensional random walks. In our opinion the algorithms, constructed for concrete data structure, will work better, than universal replacement algorithms in paging virtual and cash-memory. It was confirmed by the practice of construction of stack computers [2]. This research work was supported by the Russian Foundation for Fundamental Research, grant 01-01-00113.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. E. Knuth. The art of computer programming. Vol. Addison-Wesley, Reading, MA, 1976.

    Google Scholar 

  2. Philip J. Koopman,Jr. Stack Computers. Ellis Horwood, 1989. URL: http://www.cs.cmu.edu/koopman/stack_computers/

  3. S. Avierri, FRANKEL. Paired sequential lists in a memory interval. Inform. Process Lett, (1979)8, 9–10.

    Google Scholar 

  4. A. V. Sokolov, A. A.Lemetti. On the problem of optimal stack control. In: Probabilistic methods in discrete mathematics. Proceedings of the Fifth International Petrozavodsk Conference VSP, Utrecht, The Netnerlands,(2001). To appear.

    Google Scholar 

  5. A. V.Sokolov. About storage allocation for implementing two stacks. In: Automation of experiment and data processing. Petrozavodsk. 1980. P.65–71. (in Russian).

    Google Scholar 

  6. A. C. Yao. An analysis of a memory allocation scheme for implementating stacks. SIAM J. Computing. (1981)10, 398–403.

    Article  MATH  Google Scholar 

  7. P. Flajolet. The evolution of two stacks in bounded spase and random walks in a triangle. In: Lec. Notes Computer Sci. (1986)223, 325–340.

    Google Scholar 

  8. G. Louchard and R. Schott. Probabilistic analysis of some distributed algorithms. In: Lect. Notes Computer Sci. (1990)431, 239–253.

    Google Scholar 

  9. G. Louchard, R. Schott, M. Tolley, P. Zimmermann. Random walks, heat equation and distributed algorithms. J. Comput. Appl. Math. (1994)53, 243–274.

    Article  MATH  MathSciNet  Google Scholar 

  10. R. S. Maier. Colliding Stacks: A Large Deviations Analysis. Random Structures and Algorithms. (1991)2, 379–421.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematical Research, Karelian Research Center of the Russian Academy of Sciences, IAMR KRC RAS, 11, Pushkinskaya St., Petrozavodsk, Karelia, 185610, Russia

    Andrew V. Sokolov

Authors
  1. Andrew V. Sokolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sokolov, A.V. (2001). Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation