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.
Supported in part by the U.S. National Science Foundation under grant NCR-90-16211.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. A. Ellis. Probabilistic models of computer deadlock. Inform. Sci. 12 (1977), 43–60.
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.
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.
C. M. Kenyon-Mathieu and J. S. Vitter. The maximum size of dynamic data structures. SIAM J. Computing 20 (1991), 807–823.
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.
D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1981.
G. Louchard, C. Kenyon, and R. Schott. Data structures maxima. In Proc. FCT '91, LNCS #529, pp. 339–349. Springer-Verlag, 1991.
G. Louchard and R. Schott. Probabilistic analysis of some distributed algorithms. Random Structures and Algorithms 2 (1991), 151–186.
R. S. Maier. Colliding stacks: a large deviations analysis. Random Structures and Algorithms 2 (1991), 379–420.
H. Minc. Nonnegative Matrices. Wiley, New York, 1988.
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.
P. W. Purdom, Jr. and S. M. Stigler. Statistical properties of the buddy system. J. ACM 17 (1970), 683–697.
A. C. Yao. An analysis of a memory allocation scheme for implementing stacks. SIAM J. Computing 10 (1981), 398–403.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maier, R.S., Schott, R. (1993). The exhaustion of shared memory: Stochastic results. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_274
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive