The evolution of two stacks in bounded space and random walks in a triangle
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
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
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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
Register allocation for free: The C machine stack cache
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
RISC I: A Reduced Instruction Set VLSI Computer
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Study of a Non-Markovian Stack Management Model in a Two-Level Memory
Programming and Computing Software
| Hi-index | 0.00 |
This paper concerns issues related to building mathematical models and optimal algorithms of stacks [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 cache-memory. It was confirmed by the practice of construction of stack computers [1].Some scientists think, that non-Merkov model is more exact model of stacks behavior[12]. In [13] we have studied models, which include the possibility that, probabilities of the operations depend on the operations performed at the previous step. We can't include this models to the paper because of its small volume. On the other hand Ertl's finding concerns only particular application of stacks - stack caching for interpreters. It is very important, but there are many other applications of stacks. For example recursive algorithms, computer graphics, system tables and many other, when dynamic allocation of stacks after compilation(in the time of program running) it requires.This research work was supported by the Russian Foundation for Fundamental Research. grant 01-01-00113.