@inproceedings{78724650395746d5b71e9738715dff04,

title = "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.",

author = "Maier, {Robert S.} and Ren{\'e} Schott",

note = "Funding Information: in part by the U.S. National Science Foundation under grant NCR-90-; 3rd Workshop on Algorithms and Data Structures, WADS 1993 ; Conference date: 11-08-1993 Through 13-08-1993",

year = "1993",

doi = "10.1007/3-540-57155-8_274",

language = "English (US)",

isbn = "9783540571551",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "494--505",

editor = "Frank Dehne and Jorg-Rudiger Sack and Nicola Santoro and Sue Whitesides",

booktitle = "Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings",

}