Study of a Non-Markovian Stack Management Model in a Two-Level Memory

Authors:
E. A. Aksenova;A. A. Lazutina;A. V. Sokolov
Affiliations:
Institute of Applied Mathematical Studies, Karelian Research Center, Russian Academy of Sciences, ul. Pushkinskaya 11, Petrozavodsk, 185610 Russia avs@krc.karelia.ru;Institute of Applied Mathematical Studies, Karelian Research Center, Russian Academy of Sciences, ul. Pushkinskaya 11, Petrozavodsk, 185610 Russia avs@krc.karelia.ru;Institute of Applied Mathematical Studies, Karelian Research Center, Russian Academy of Sciences, ul. Pushkinskaya 11, Petrozavodsk, 185610 Russia avs@krc.karelia.ru
Venue:
Programming and Computing Software
Year:
2004

Citing 7
Cited 1

A performance analysis of automatically managed top of stack buffers

ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Stack caching for interpreters

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Random walks, heat equation and distributed algorithms

Journal of Computational and Applied Mathematics
High-speed top-of-stack scheme for VLSI processor: a management algorithm and its analysis

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Contentaddressable Memories

Contentaddressable Memories
Optimization strategies of stack control

PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle

Mathematical Foundations of Computer Science 1986

The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A non-Markovian model of stack behavior is suggested and studied. In this model, the probability of the operation to be performed on the stack at the next step depends on the operation performed at the current step. Theoretically optimal stack control algorithms in a two-level memory are suggested.