Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control

Authors:
Andrew V. Sokolov
Affiliations:
-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 2
Cited 0

Probabilistic analysis of some distributed algorithms

CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Random walks, heat equation and distributed algorithms

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns issues related to building mathematical models and optimal algorithms of stacks and queues [1] control in singleand 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.