The exhaustion of shared memory: Stochastic results

Robert S. Maier, René Schott

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Nicola Santoro, Sue Whitesides
Number of pages12
ISBN (Print)9783540571551
StatePublished - 1993
Event3rd Workshop on Algorithms and Data Structures, WADS 1993 - Montreal, Canada
Duration: Aug 11 1993Aug 13 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume709 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd Workshop on Algorithms and Data Structures, WADS 1993

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The exhaustion of shared memory: Stochastic results'. Together they form a unique fingerprint.

Cite this