### 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.

Original language | English (US) |
---|---|

Title of host publication | Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings |

Editors | Frank Dehne, Jorg-Rudiger Sack, Nicola Santoro, Sue Whitesides |

Publisher | Springer-Verlag |

Pages | 494-505 |

Number of pages | 12 |

ISBN (Print) | 9783540571551 |

State | Published - Jan 1 1993 |

Event | 3rd Workshop on Algorithms and Data Structures, WADS 1993 - Montreal, Canada Duration: Aug 11 1993 → Aug 13 1993 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 709 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 3rd Workshop on Algorithms and Data Structures, WADS 1993 |
---|---|

Country | Canada |

City | Montreal |

Period | 8/11/93 → 8/13/93 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings*(pp. 494-505). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 709 LNCS). Springer-Verlag.