WADS 1993: Algorithms and Data Structures pp 494-505 | Cite as
The exhaustion of shared memory: Stochastic results
Abstract
We analyse a model of exhaustion of shared memory. The memory usage of a finite number of dynamic data structures is modelled as a Markov chain, and the asymptotics of the expected time until memory exhaustion are worked out, in the limit when memory availability and memory needs scale proportionately, and are taken to infinity. This stochastic model subsumes the model of colliding stacks previously treated by the authors, and gives rise to difficult mathematical problems. However, analytic results can be obtained in the limit. Our analysis uses a technique of matched asymptotic expansions introduced by Naeh et al. [11]. The technique is applicable to other stochastically modelled discrete algorithms.
Keywords
Markov Chain Shared Memory Memory Unit Resource Unit Matched Asymptotic ExpansionPreview
Unable to display preview. Download preview PDF.
References
- 1.C. A. Ellis. Probabilistic models of computer deadlock. Inform. Sci. 12 (1977), 43–60.Google Scholar
- 2.P. Flajolet. The evolution of two stacks in bounded space and random walks in a triangle. In Proc. MFCS '86, LNCS #233, pp. 325–340. Springer-Verlag, 1986.Google Scholar
- 3.A. N. Habermann. System Deadlocks. In Current Trends in Programming Methodology, edited by K. M. Chandy and R. T. Yeh, volume 3. Prentice-Hall, 1978.Google Scholar
- 4.C. M. Kenyon-Mathieu and J. S. Vitter. The maximum size of dynamic data structures. SIAM J. Computing 20 (1991), 807–823.Google Scholar
- 5.C. Knessl, B. J. Matkowsky, Z. Schuss, and C. Tier. An asymptotic theory of large deviations for Markov jump processes. SIAM J. Appl. Math. 46 (1985), 1006–1028.CrossRefGoogle Scholar
- 6.D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1981.Google Scholar
- 7.G. Louchard, C. Kenyon, and R. Schott. Data structures maxima. In Proc. FCT '91, LNCS #529, pp. 339–349. Springer-Verlag, 1991.Google Scholar
- 8.G. Louchard and R. Schott. Probabilistic analysis of some distributed algorithms. Random Structures and Algorithms 2 (1991), 151–186.Google Scholar
- 9.R. S. Maier. Colliding stacks: a large deviations analysis. Random Structures and Algorithms 2 (1991), 379–420.Google Scholar
- 10.H. Minc. Nonnegative Matrices. Wiley, New York, 1988.Google Scholar
- 11.T. Naeh, M. M. Klosek, B. J. Matkowsky, and Z. Schuss. A direct approach to the exit problem. SIAM J. Appl. Math. 50 (1990), 595–627.CrossRefGoogle Scholar
- 12.P. W. Purdom, Jr. and S. M. Stigler. Statistical properties of the buddy system. J. ACM 17 (1970), 683–697.Google Scholar
- 13.A. C. Yao. An analysis of a memory allocation scheme for implementing stacks. SIAM J. Computing 10 (1981), 398–403.Google Scholar